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 vote189 views1 answer
Python get bits from byte
Python
0 vote197 views1 answer
How to replace an element of a list using list comprehension
Python
1 vote259 views1 answer
Django genericforeignkey null
Python Django
1 vote234 views1 answer
Difference between get and filter in django
Python Django
0 vote203 views1 answer
Any value in list will retrun true python
Python
1 vote223 views1 answer
Django clear db
Python Django
0 vote190 views1 answer
Sns plot standard form
Python
2 votes204 views1 answer
No module named 'libtorrent'
Python
1 vote193 views1 answer
Python random hex color
Python
0 vote220 views1 answer
Get full detail inside of id in django rest framework many to many
Python Django