说明

第二个元素开始，当前值与前面的值进行对比，然后不断左移动

步骤如下

1. [5,2,4,6,1,3]
2. [2,5,4,6,1,3]
3. [2,4,5,6,1,3]
4. [2,4,5,6,1,3]
5. [1,2,4,5,6,3]
6. [1,2,3,4,5,6]

代码

from typing import List
def insert_sort(A:List[int])->List[int]:
    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
    return A
    
result = insert_sort([5,2,4,6,1,3])
print(result)