Function insertion_sort

sorts/tim_sort.py:19–27

(lst: list[Any])

def insertion_sort(lst: list[Any]) -> list[Any]:
    length = len(lst)

    for index in range(1, length):
        value = lst[index]
        pos = binary_search(lst, value, 0, index - 1)
        lst = [*lst[:pos], value, *lst[pos:index], *lst[index + 1 :]]

    return lst


def merge(left: list[Any], right: list[Any]) -> list[Any]: