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 vote207 views1 answer
Example of Ternary Operator in Python
Python
0 vote204 views1 answer
After groupby how to add values in two rows to a list
Python
0 vote203 views1 answer
Creation 2eme fenetre tkinter
Python
0 vote198 views1 answer
@action(detail=true) meaning
Python
0 vote183 views1 answer
Minio python remove a bucket
Python
1 vote164 views1 answer
32 bit binary in python
Python
1 vote161 views1 answer
Random .randint renpy
Python
2 votes188 views2 answers
Python program for geometric progression
Python
2 votes190 views1 answer
Python string argument without an encoding
Python
20 votes201 views5 answers
Join lists python
Python