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 vote102 views1 answer
Pandas mask multiple condition
Python
0 vote96 views1 answer
Linear congruential generator in python
Python
0 vote105 views1 answer
Numpy random.permutation
Python
0 vote123 views1 answer
A function for reviewing a list's order of magnitude in python
Python
0 vote103 views1 answer
Python split string after substring
Python
1 vote104 views1 answer
Import numpy financial python
Python
3 votes96 views1 answer
Pyautogui moveTo overtime
Python
50 votes100 views6 answers
Python uppercase
Python
2 votes91 views2 answers
Check cuda
Python
0 vote120 views2 answers
Python seperate int into digit array
Python