[数据结构与算法]Python实现归并排序

有关归并排序的原理以及动图显示可以参考下面网站

排序算法动图展示

def merge(left,right) :
     res = []
#     print(left,right)
     while(left and right):
         if left[0] > right[0]:
             res.append(right.pop(0))
         else:
             res.append(left.pop(0))
     
     while left:
         res.append(left.pop(0))
     while right:
         res.append(right.pop(0))
     return res
    
def guibing(nums):
     if len(nums) <= 1:
         return nums
     middle = int(len(nums)/2)
     return  merge(guibing(nums[0:middle]),guibing(nums[middle:len(nums)])) 


#举个例子
nums = [2,6,1,45,65,1234,53]
print(guibing(nums))
[1, 2, 6, 45, 53, 65, 1234]