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 vote317 views1 answer
How to uninstall python-dotenv
Python
0 vote361 views1 answer
Python pil get pixel
Python
23 votes431 views6 answers
Flask post
Python Flask
0 vote370 views1 answer
Poisson disc python
Python
5 votes324 views2 answers
Converter python to C
Python
14 votes331 views1 answer
Pd.to_datetime python
Python
1 vote374 views1 answer
AttributeError: 'ElementTree' object has no attribute 'getiterator'
Python
0 vote297 views1 answer
Check if list elememnt in dataframe column
Python
3 votes329 views2 answers
Clear outpur jupyter
Python
0 vote331 views1 answer
Statsmodels logistic regression odds ratio
Python