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

20 votes290 views3 answers
Python inline if
Python
20 votes143 views5 answers
Save list to file python
Python
1 vote124 views1 answer
Django datetimefield default
Python
0 vote305 views1 answer
Django form custom validation
Python Django
11 votes131 views6 answers
Python merge dict
Python
0 vote141 views1 answer
Discordpy get role by id
Python
0 vote143 views2 answers
Feature selection python
Python
91 votes133 views4 answers
String remove last 3 characters python
Python
0 vote128 views1 answer
Python wget anaconda
Python
0 vote153 views1 answer
Sample one point from distribution python
Python