插入算法

def insert_sort(seq):
    for j in range(1, len(seq)):
        target = seq[j]
        index = j
        while index > 0 and seq[index-1] > target:
            seq[index] = seq[index-1]
            index -= 1
        seq[index] = target


def test_insert_sort():
    seq = list(range(12))
    random.shuffle(seq)
    time.sleep(1)
    temp = sorted(seq)
    insert_sort(seq)
    assert seq == temp
    assert 0