Speed: Insertion Sort The algorithm takes one value at a time from the unsorted part of the array and puts it into the right place in the sorted part of the array, until the array is sorted.How it works: Take the first value from the unsorted part of the array. Move the value into...
The worst case scenario for Insertion Sort is if the array is already sorted, but with the highest values first. That is because in such a scenario, every new value must "move through" the whole sorted part of the array.These are the operations that are done by the Insertion Sort ...