python实现的插入法排序
def sort_insert(A):
for j in range(1, len(A)):
key = A[j]
i = j - 1
while i >= 0 and A[i] > key:
A[i+1] = A[i]
i -= 1
A[i+1] = key
print A
sort_insert([89, 12, 45, 67, 10, 13])