Step 1: Start with an unsorted array of integers.
We're going to take a single item from the unsorted array and find its correct position in the sorted array.
This is the most important step, as it sets the tone for the rest of the algorithm.
Don't skip this step, or the rest of the algorithm will fall apart like a house of cards in a strong gust of wind.
Or something.