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

3 votes261 views2 answers
Publisher python ros
Python
0 vote249 views1 answer
Get scipy version python
Python
13 votes275 views5 answers
Pandas replace values in column based on condition
Python
0 vote252 views1 answer
Transform jpg image into array for conv2d
Python
0 vote241 views1 answer
Grading system in python with nested if
Python
0 vote276 views1 answer
Math domain error python
Python
0 vote287 views2 answers
Loop only to the 6th element python
Python
0 vote267 views1 answer
Ellipsis in python as index
Python
0 vote263 views1 answer
Python correlation between features and target
Python
0 vote298 views2 answers
Generate random password django
Python Django