Question

How to implement insertion sort in Python

Answer 1

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

lst = [2, 141, 3, 4, 21, 98, 13, 30, 50]

insertion_sort(lst)

print(lst)



'''
run:

[2, 3, 4, 13, 21, 30, 50, 98, 141]

'''

 

70+ SQL courses for beginners and professionals

Answer 2

def insertion_sort(lst):
    size = len(lst)
    
    for i in range(1, size):
        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 = [2, 141, 1, 3, 4, 21, 98, 13, 30, 50]

insertion_sort(lst)

print(lst)



'''
run:

[1, 2, 3, 4, 13, 21, 30, 50, 98, 141]

'''

 

70+ SQL courses for beginners and professionals