bx05_insert_sort

def insert_sort(li):

    # i: 摸到的牌的 index
    for i in range(1, len(li)):
        # 记录下这张牌，防止被覆盖掉
        temp = li[i]
        # j: 手里最右边牌的 index
        j = i - 1

        while j >= 0 and li[j] > temp:
            li[j + 1] = li[j]
            j -= 1
        li[j + 1] = temp