Python写算法（一）插入排序

#-*-coding=utf8-*-
#插入排序算法
#插入排序思想：按集合的顺序每次从集合中取一个数插入此数前面位置（与前面位置数依次比较后插入合适位置）

def insertionSort(A):
for j in range(len(A)):
key = A[j]
i = j - 1
while i >= 0 and A[i] > key:
A[i+1] = A[i]
i = i -1
A[i+1] = key
return A

if __name__ == "__main__":
A = [3,4,7,1,8,9,12,5,2,3]
print A
print "sorted:",insertionSort(A)