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 vote298 views1 answer
Python wifi moudel [WinError 2] The system cannot find the file specified
Python
0 vote245 views1 answer
Pandas dataframe macd
Python
0 vote276 views2 answers
Make virtual environment wrapper python 3
Python
0 vote236 views1 answer
Recursive Folder scan
Python
1 vote246 views1 answer
What is the purpose of the judiciary
Python
1 vote267 views1 answer
Py file open with
Python
0 vote244 views1 answer
Subplot matplotlib set limits
Python
0 vote239 views1 answer
List comprehension odd numbers python
Python
5 votes255 views3 answers
Pygame quit
Python
1 vote283 views1 answer
Get current site django
Python