The Insertion sort algorithm simple and readable implementation in Python

insertion_sort.py

from typing import List


def insertion_sort(lst: List[int]) -> None:
    """The Insertion sort algorithm.
    
    The sorted list is placed in place.
    Wikipedia: https://en.wikipedia.org/wiki/Insertion_sort
    """
    for i in range(1, len(lst)):
        for j in range(i):
            if lst[i] < lst[j]:
                lst.insert(j, lst.pop(i))
                break