Insertion sort in Python.

insertion_sort.py

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