归并排序
def merge_sort(l):
length=len(l)
if length==1:
return l
left=merge_sort(l[:length//2])
right=merge_sort(l[length//2:])
i=j=0
while i<length//2 and j<length-length//2:
if left[i]<right[j]:
l[i+j]=left[i]
i+=1
else:
l[i+j]=right[j]
j+=1
if i==length//2:
l[i+j:]=right[j:]
else:
l[i+j:]=left[i:]
return l
x=[6,2,4,3,1,5]
print(x)
print(merge_sort(x))