A = [8, 9, 120, 1, 4, 16, 14]
def insertion_sort(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 = i - 1
A[i+1] = key
print(A)
insertion_sort(A)
print(A)