合并排序_python

 #!/usr/bin/python
 # --coding:utf-8 --

 def sort_merge(left,right):
     i,j=0,0
     result=[]
     while i<len(left) and j<len(right):
         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

 def sortdata(input):
     if len(input)==1:
         return input
     index=len(input)//2
     left=sortdata(input[:index])
     right=sortdata(input[index:])
     return sort_merge(left,right)

 print(sortdata([3,5,9,10,13,35,56]))

 # left                       right
 # 3,5,9                     10,3,35,56
 # left  right            left         right
 # 3      5,9             10 ,3         35,56
 #        left right      left  right    left  right
 #         5     9          10    3       35     56

结果：

[3, 5, 9, 10, 13, 35, 56]
[Finished in 0.5s]