You will almost always use Python's sorted, but writing sorting algorithms yourself is the classic way to learn to think algorithmically, and it explains why some approaches are thousands of times faster than others.

Selection sort is how many people sort a hand of cards: find the smallest card, put it first; find the smallest of the rest, put it second; and so on.

def selection_sort(items):
    items = items[:]
    for i in range(len(items)):
        smallest = i
        for j in range(i + 1, len(items)):
            if items[j] < items[smallest]:
                smallest = j
        items[i], items[smallest] = items[smallest], items[i]
    return items

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

items = items[:] makes a copy first, so the caller's list isn't changed. Then, for each position i, the inner loop finds where the smallest remaining item is, and one swap moves it into place.

Pass	List after the swap
start	29 10 14 37 13
1	10 29 14 37 13
2	10 13 14 37 29
3	10 13 14 37 29
4	10 13 14 29 37