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 vote324 views1 answer
Merge 2 or more notebooks into one
Python
0 vote375 views1 answer
Django time cualtulate
Python Django
0 vote395 views1 answer
Djangobook.com jwd django restfremwork plugin
Python Django
115 votes374 views6 answers
Python user input
Python
0 vote318 views2 answers
Run matlab code in python
Python
8 votes268 views2 answers
Create a list of alphabets in python
Python
1 vote308 views1 answer
Polynomial regression using scikit-learn library
Python
0 vote366 views1 answer
Access django server from another machine
Python Django
2 votes274 views2 answers
Python threading return value
Python
4 votes327 views3 answers
How to check if a number is a perfect square python
Python