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 vote227 views1 answer
Python check if ip is up or down
Python
5 votes200 views2 answers
Python train test val split
Python
0 vote235 views1 answer
How to extract field values in list from queryset in django
Python Django
19 votes200 views2 answers
How to avoid deprecation warning in python
Python
0 vote182 views2 answers
How to make python faster than c++
Python
5 votes200 views2 answers
Get_object_or_404 django
Python
1 vote192 views1 answer
How to define dtype of each column before actually reading csv file
Python
0 vote201 views1 answer
Dividing counter object in python
Python
0 vote191 views1 answer
Voting classifier with different features
Python
4 votes170 views2 answers
Endswith python
Python