算法导论Python实现

1. 插入排序

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 -= 1
        A[i + 1] = key


alist = [1, 2, 3, 4, 5]
insertion_sort(A=alist)