InsertionSort

# Insertion sort in Python


def insertionSort(array):

    for step in range(1, len(array)):
        key = array[step]
        j = step - 1
        
        # Compare key with each element on the left of it until an element smaller than it is found
        # For descending order, change key<array[j] to key>array[j].        
        while j >= 0 and key < array[j]:
            array[j + 1] = array[j]
            j = j - 1
        
        # Place key at after the element just smaller than it.
        array[j + 1] = key


data = [9, 5, 1, 4, 3]
insertionSort(data)
print('Sorted Array in Ascending Order:')
print(data)

Source: programiz.com

Similar codes

1 vote231 views2 answers
Rsplit string from last
Python
0 vote231 views3 answers
Python multiplication table while loop
Python
1 vote282 views1 answer
Django get part of queryset
Python
-1 vote245 views2 answers
Shell script to convert yaml
Python
0 vote213 views1 answer
How to use with statement in python 2.5 and earlier
Python
0 vote240 views2 answers
Python assert
Python
-1 vote254 views1 answer
Set label text size tkinter
Python
0 vote226 views1 answer
Python get nearest value in list
Python
0 vote229 views1 answer
Loading kivy lang
Python
0 vote231 views1 answer
Napalm cli
Python