Answer:

Consider the first element as “sorted” (might not necessarily be true)

Create temp variable for first unsorted number

Check over each number in the sorted partition (decrementing right to left)

If the decremented element is greater than temp, shift it to the right by 1 spot.

Once the decremented element is less than or equal to temp, overwrite the number after the decremented element with temp, thus “inserting” it.