算法导论2.1插入排序

插入排序在P10页，学习重点为循环不变式的正确性
python代码实现如下，为升序排序

#ascending
def InsertionSort(A:list):
    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
    return A
A=[5,2,4,6,1,3]
print(InsertionSort(A))