python实现排序算法

复制代码 代码如下:

def insertion_sort(n):
    if len(n) == 1:
        return n
    b = insertion_sort(n[1:])
    m = len(b)
    for i in range(m):
        if n[0] <= b[i]:
            return b[:i]+[n[0]]+b[i:]
    return b + [n[0]]
l = [1,3,4,2,6,7,9,12,11,789,345,456]
print insertion_sort(l)
d = input('l=')
print insertion_sort(d)
a = input('y:')