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 vote198 views1 answer
First n prime number finder in python
Python
0 vote172 views1 answer
Convert string to object in python
Python
0 vote180 views1 answer
Corresponding angles
Python
12 votes169 views2 answers
Filtering a list
Python
0 vote167 views2 answers
Pdf to word
Python
6 votes172 views2 answers
Run python version from terminal
Python
0 vote169 views1 answer
How to send jobs to queue dynamically
Python
0 vote180 views1 answer
Prettify json in pycharm
Python
0 vote186 views1 answer
How to write a first program in machine learning
Python
54 votes164 views5 answers
Sort dict by value python 3
Python