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

0 vote277 views1 answer
Pipenv installs
Python
0 vote242 views2 answers
Python script in excel
Python
7 votes228 views5 answers
Pillow create image
Python
26 votes267 views6 answers
Square root in python
Python
31 votes262 views5 answers
How to place image in tkinter
Python
0 vote240 views1 answer
Check version of package poetry
Python
0 vote266 views1 answer
Comment voir les requêtes SQL brutes exécutées par Django?
Python Django
0 vote243 views1 answer
Odd or even checker
Python
0 vote249 views1 answer
How to know the number of CPu using python
Python
0 vote251 views1 answer
Convert file to base64 python
Python