- 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,7,12,11,789,345,456]
- print insertion_sort(l)
- d = input('l=')
- print insertion_sort(d)
- a = input('y:')
- #该片段来自于http://www.codesnippet.cn/detail/040320148879.html
来源: http://www.codesnippet.cn/detail/040320148879.html