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 vote197 views3 answers
Python every other goes to a list
Python
31 votes191 views2 answers
Anaconda create environment python version
Python
4 votes209 views5 answers
Print hello in python
Python
5 votes175 views1 answer
Tkinter minsize
Python
35 votes195 views6 answers
Python for in range
Python
0 vote189 views2 answers
Python datetime to seconds
Python
0 vote170 views1 answer
Getting tradingview historical data using python
Python
0 vote209 views1 answer
Django queryset to instance
Python Django
0 vote173 views1 answer
Declare pandas dataframe with values
Python
0 vote158 views1 answer
Python add new line from textarea
Python