insertion sort algorith code example

Example: insertion sort python

def insertion_sort(lst):
    for i in range(1,len(lst)):
        while i > 0 and lst[i - 1] >lst[i] :
            lst[i - 1], lst[i] = lst[i] , lst[i - 1]
            ## swapping
            i = i -1
    return lst
print(insertion_sort([4,2,2,3,4,3,1,1,1,2]))