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 vote131 views1 answer
Python get all ips in a range
Python
0 vote131 views1 answer
Pyqgis
Python
5 votes140 views3 answers
String to float python pandas
Python
0 vote88 views1 answer
Finetune vision model huggingface pytorch github
Python
0 vote127 views1 answer
Dataproc initialization_actions error
Python
1 vote123 views1 answer
Python order 2d array by secode element
Python
0 vote136 views2 answers
Python faculty of 0 is 1 faculty of 1 is 1
Python
50 votes153 views1 answer
How to find item in list python without indexnig
Python
0 vote118 views2 answers
Re.add python
Python
21 votes194 views6 answers
Python avg
Python