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 vote144 views1 answer
Change xlabel python
Python
6 votes212 views3 answers
Flask get ip of user
Python Flask
6 votes154 views2 answers
Merge list elements python
Python
1 vote151 views1 answer
Django ckeditor not working
Python
0 vote160 views1 answer
Radice n esima python
Python
11 votes158 views6 answers
Python get file size
Python
6 votes165 views2 answers
Update jupyter notebook
Python
-1 vote149 views2 answers
Format timedelta python
Python
0 vote168 views1 answer
How to save model to a file python
Python
0 vote149 views2 answers
Max between two numbers python
Python