insertion_sort.py

def test():
    A = [5,2,4,6,1,3]
    print(A)

    for i in range(1, len(A)):
        print('A', A)
        v = A[i]

        # search insert position
        j = i - 1
        while j >= 0 and A[j] > v:
            A[j+1] = A[j]
            j -= 1
        A[j+1] = v
    print(A)

if __name__ == '__main__':
    test()