
代码:
def merge_sort(arr):
if len(arr) == 1:
return arr
mid = len(arr)//2
l= arr[:mid]
r = arr[mid:]
left = merge_sort(l)
right = merge_sort(r)
return merge(left,right)
def merge(left,right):
result = []
while len(left) >0 and len(right) > 0:
if left[0] <= right[0]:
result.append(left.pop(0))
else:
result.append(right.pop(0))
if len(left) == 0:
result += right
else:
result += left
print(result)
return result
a = merge_sort([3,2,4,5,6,7,8,8,2,1])
print(a)

被折叠的 条评论
为什么被折叠?



