python InsertSort

插入排序
a = [2,5,34,7,83,1,7]
print(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)