def merge_sort(a):
n=len(a)
if n<=1:
return a
mid=n//2
left=merge_sort(a[:mid])
right=merge_sort(a[mid:])
left_point,right_point=0
result=[]
while left_point<len(left) and right_point<len(right):
if left[left_point]<right[right_point]:
result.append(left[left_point])
left_point+=1
else:
result.append(right[right_point])
right_point+=1
result+=left[left_point:]
result+=right[right_point:]
return result
归并排序_merge (python)
最新推荐文章于 2020-12-30 05:24:50 发布