insertion_sort.py

def insertion_sort(list: [int]) -> [int]:
    for i in range(1, len(list)):
        element = list[i]
        j = i - 1
        while j >= 0 and element < list[j]:
            list[j + 1] = list[j]
            j -= 1
        list[j + 1] = element
    return list