Insertion Sort builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
Check out the resources below for a review of Insertion sort!
def insertion_sort(arr): # For every index in array for i in range(1,len(arr)): # Set current values and position currentvalue = arr[i] position = i # Sorted Sublist while position > 0 and arr[position-1] > currentvalue: arr[position]=arr[position-1] position = position-1 arr[position] = currentvalue
arr =[3,5,4,6,8,1,2,12,41,25] insertion_sort(arr) print(arr)
[1, 2, 3, 4, 5, 6, 8, 12, 25, 41]
If you like my post please follow me to read my latest post on programming and technology.
You are given two singly linked lists that intersect at some node. Your task is…
A builder plans to construct N houses in a row, where each house can be…
Find the length of the longest absolute path to a file within the abstracted file…
You manage an e-commerce website and need to keep track of the last N order…
You are given a stream of elements that is too large to fit into memory.…
The formula for the area of a circle is given by πr². Use the Monte…