A30046. $下列归并算法程序中，横线处应该填入的是（）def merge_sort(array): if len(array) == 1: return array _________________________ return merge(left, right)def merge(left, right): left_index, right_index, merge_array = 0, 0, l\dots$

单选题困难

知识点

归并排序递归分治算法

题目描述

下列归并算法程序中，横线处应该填入的是（ ） def merge_sort(array): if len(array) == 1: return array_________________________return merge(left, right) def merge(left, right): left_index, right_index, merge_array = 0, 0, list() while left_index < len(left) and right_index < len(right): if left[left_index] <= right[right_index]: merge_array.append(left[left_index]) left_index += 1 else: merge_array.append(right[right_index]) right_index += 1 merge_array = merge_array + left[left_index:] + right[right_index:] return merge_array

left = merge_sort(array[:len(array)-1//2]) right = merge_sort(array[len(array)-1//2:])

left = merge_sort(array[len(array)//2-1]) right = merge_sort(array[len(array)//2:])

left = merge_sort(array[len(array)//2-1]) right = merge_sort(array[len(array)//2])

left = merge_sort(array[:len(array)//2]) right = merge_sort(array[len(array)//2:])

上一题下一题