Insertion Sort

#The function of sorting element in ascending order
def insertionSort(lst):
    for i in range(1, len(lst)):
        # insert lst[i] into a sorted sublist lst[0 : i] so that
        # lst[0 : i+1] is sorted.
        currentElement = lst[i]
        k = i - 1
        while k >= 0 and lst[k] > currentElement:
            lst[k + 1] = lst[k]
            k -= 1

        # Insert the current element into lst[k +1]
        lst[k + 1] = currentElement


lst = [1, 9, 4.5, 10.6, 5.7, -4.5]
insertionSort(lst)
print(lst)