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

82 votes165 views5 answers
Python requirements.txt
Python
12 votes170 views1 answer
Create an environment in conda
Python
16 votes179 views6 answers
List.add in python
Python
2 votes171 views2 answers
Sha512 python
Python
1 vote245 views1 answer
List comprehension - list files with extension in a directory
Python
3 votes156 views2 answers
Select categorical columns pandas
Python
0 vote166 views1 answer
Stdfilt python
Python
0 vote158 views1 answer
Sns.lineplot
Python
0 vote209 views6 answers
Python django
Python Django
1 vote162 views1 answer
Python check if variables are the same
Python