inset sort; 插入排序

foo.py

import random
from typing import List

test_case = [2, 1, 3, 8, 0]


def insert_sort(l: List[int]) -> List[int]:
    if l is []:
        return []
    length = len(l)
    for i in range(1, length):
        cur = l[i]
        for j in range(i)[::-1]:
            if l[j] < cur:
                break
            if l[j] >= cur:
                l[j + 1] = l[j]
            l[j] = cur
    return l


if __name__ == '__main__':
    print(insert_sort(test_case))