使用递归进行插入排序

算法导论习题2.3-4

# -*- coding: utf-8 -*-
def linearsort(l, n):
if n > 1:
linearsort(l, n-1)
insert(l, n)

def insert(l, n):
an = l.pop(n-1)
for y in range(0, n-1):
if an <= l[y]:
break
else:
y += 1
l.insert(y, an)

l = [4, 6, 2, 9, 6, 8, 7, 9, 1]
linearsort(l, len(l))
for x in l:
print x,