[Python] Insertion_sort

[ropering]

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

lst = [7, 4, 9, 2, 6, 3]
insertion_sort(lst)
print('Sorted %s' %lst) # Sorted [2, 3, 4, 6, 7, 9]