【插入排序实现】python

INSERTION-SORT(A)

for j <-- 2 to length[A]

    do key <-- A[j]

    i <-- j-1

    while i>0 and A[i]>key

        do A[i+1] <-- A[i]

            i <-- i-1

    A[i+1] <--  key

python实现：

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

A = [5,2,4,6,1,3]

insertion_sort(A)

print(A)