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

1 vote272 views1 answer
Python code to plot pretty figures
Python
9 votes286 views6 answers
Convert dataframe to float
Python
0 vote286 views2 answers
Python argsort
Python
0 vote256 views1 answer
Gtk entry not editable python
Python
14 votes310 views3 answers
How to find highest number in list without using max function python
Python
11 votes263 views2 answers
Format python number with commas
Python
0 vote278 views1 answer
Tkinter yt downloader with resolution
Python
0 vote294 views1 answer
How to slice few rows in pandas
Python
0 vote279 views1 answer
Django 3 create async rest api
Python
0 vote290 views1 answer
Change Separator Value When Printing
Python