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 vote119 views1 answer
If function has no argument python
Python
1 vote114 views2 answers
Python regex get word after string
Python
0 vote123 views1 answer
Add many instances to related field manytoamny django]
Python Django
5 votes119 views3 answers
Opencv python shrink image
Python
0 vote108 views1 answer
Defaultdict item count
Python
1 vote108 views1 answer
Python watchgod
Python
14 votes177 views3 answers
Flask link stylesheet
Python Flask
0 vote111 views2 answers
How to write a python script to find the value of x at a given y value
Python
0 vote143 views1 answer
RuntimeError: cuda runtime error (711) : peer mapping resources exhausted at /pytorch/aten/src/THC/THCGeneral.cpp:139
Python
0 vote121 views1 answer
Df.loc a list of index
Python