Insertion Sort: The Agony of Progress
Warning: This algorithm is known to be slower than a sloth on a treadmill. Click here to learn more about its competitors.
Insertion sort is a sorting algorithm that is as painful as a root canal. But, hey, it gets the job done... eventually. Like this guy.
Step 1: Take a Number
The algorithm starts by taking a number from the unsorted list, like this:
1, 4, 2, 8, 3, 7, 6, 5, 9, ?
Where ? is the number we're going to take.