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 vote286 views3 answers
Dataframe to dictionary using index as key
Python
1 vote308 views2 answers
One hot encoder python
Python
0 vote300 views1 answer
Python Remove all occurrences of a character from a string
Python
0 vote327 views1 answer
One2many add tuple
Python
0 vote302 views1 answer
RemoveStopWords
Python
2 votes300 views2 answers
Search in django
Python Django
2 votes292 views1 answer
Hyperlinks in jupyter notebook
Python
0 vote271 views2 answers
Python simple project
Python
0 vote279 views1 answer
Python tuple range
Python
1 vote303 views1 answer
Read a function of excel in python
Python