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 vote316 views1 answer
Godot variablen einen wert hinzufügen
Python
6 votes326 views1 answer
Python merge two array into one
Python
-1 vote349 views1 answer
Function TBone() if 2=2 then print("Sup") end
Python
0 vote339 views1 answer
Get the factorial of a number on python
Python
0 vote361 views1 answer
Python how to print something at a specific place
Python
0 vote357 views1 answer
Find the highest id in model django
Python
0 vote350 views2 answers
Download python on wsl
Python
9 votes374 views2 answers
Lambda condition python
Python
1 vote382 views1 answer
How to use enumerate instead of range and len
Python
2 votes338 views1 answer
Save a dict to pickle
Python