A31213. $下列归并算法程序中，横线处应该填入的是（）。def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = arr[:mid] right = arr[mid:] merge_sort(left) merge_sort(right) return merge(left, right)def merge(l\dots$

单选题 10

知识点

归并排序分治算法双指针递归

题目描述

下列归并算法程序中，横线处应该填入的是（ ）。 def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = arr[:mid] right = arr[mid:] merge_sort(left) merge_sort(right) return merge(left, right) def merge(left, right): result = [] i, j = 0, 0 ——————————————— if left[i] < right[j]: result.append(left[i]) i += 1 else: result.append(right[j]) j += 1 result += left[i:] result += right[j:] return result

while i > len(left) and j < len(right):

while i < len(left) and j > len(right):

while i > len(left) and j > len(right):

while i < len(left) and j < len(right):

上一题下一题