This is what I wrote for insertion sort in python. But somehow I'm feeling that it's between bubble and insertion sort.def insertionSort(lst):    for i in range(1, len(lst)):        if lst[i] < lst[i-1]:            for j in range(i):                if lst[i] < lst[j]:                    lst[i], lst[j] = lst[j], lst[i]    return lstif __name__ == '__main__':    lst = [64, 88, 51, 65, 90, 75, 34, 79, 46, 36]    print insertionSort(lst)
Insertion Sort in Python
python;algorithm;sorting;insertion sort