Insertion sort is one of the most common sorting algorithms you’ll ever bump into. It is very simple and it takes time roughly equal to c*n2 to sort n items, where c is an undependable constant.
Input: a sequence of n unsorted numbers
Output: a sequence of permuted n numbers from the input such that those numbers are sorted in most of the time decreasing order.
How it works
Indexes of numbers in this […]