Insertion sort keeps the front of the list sorted. It takes each next item and slides it left past every bigger item, until it's in the right place, like inserting a new card into a sorted hand:

def insertion_sort(items):
    items = items[:]
    for i in range(1, len(items)):
        current = items[i]
        j = i - 1
        while j >= 0 and items[j] > current:
            items[j + 1] = items[j]
            j -= 1
        items[j + 1] = current
    return items

print(insertion_sort([29, 10, 14, 37, 13]))

Bigger items shuffle one place right to make a gap, and current drops into it.

Insertion sort is also O(n²) in the worst case, but it has a useful property: on a list that's already nearly sorted, each item only moves a little, so it's very fast, close to O(n). That's why real-world sorting algorithms, including Python's own, use it for small or nearly-sorted pieces.