Computer Science · Algorithms

What does the following merge sort merge step return for left = [1, 3] and right = [2, 4]? i = 0, j = 0 result = [] while i < len(left) and j < len(right): if left[i] <= right[j]: result.append(left[i]); i += 1 else: result.append(right[j]); j += 1 while i < len(left): result.append(left[i]); i += 1 while j < len(right): result.append(right[j]); j += 1 return result