算法：归并排序

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

def Mege(list):
    if(len(list)<=1):
        return list
    num = int(len(list)/2)
    left = Mege(list[:num])
    right = Mege(list[num:])
    return Mag(left,right)

def Mag(left,right):
    l,r=0,0
    result = []
    while l<len(left) and r<len(right):
        if left[l]<right[r]:
            result.append(left[l])
            l += 1
        else:
            result.append(right[r])
            r += 1
    result += left[l:]
    result += right[r:]
    return result

if __name__ == '__main__':
    print(Mege([1,2,3,11,90,13,20,58,77,28,10]))