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 vote159 views1 answer
Python random randint string
Python
1 vote189 views1 answer
Code for showing contents of a file and printing it in python
Python
0 vote176 views2 answers
Pandas delete first row
Python
0 vote175 views2 answers
Python builtwith
Python
4 votes183 views2 answers
Python get all images in directory
Python
0 vote170 views1 answer
Return tuples form functions in Python
Python
0 vote186 views1 answer
Pyfiglet not coming up cmd
Python
0 vote186 views1 answer
Intersection between two arrays using numpy
Python
-1 vote182 views1 answer
Python design patterns
Python
0 vote163 views1 answer
Give columns while reading csv
Python