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

4 votes157 views2 answers
Pandas rolling
Python
22 votes162 views6 answers
How to take list input in python
Python
0 vote200 views1 answer
Django blog new post
Python Django
-1 vote151 views4 answers
Play video in colab
Python
0 vote160 views1 answer
Py regex if .jpg
Python
0 vote161 views1 answer
Python console width
Python
0 vote179 views1 answer
Median absolute deviation scipy
Python
0 vote164 views1 answer
Jumpssh execute multiple commands
Python
18 votes155 views4 answers
How to play audio in python
Python
20 votes142 views4 answers
Current year in python
Python