So the way that we do Insertion Sort is you go element by element, and then you compare it to the elements before it, and then you look for the 1st element before it that it is actually less than, and then you just stick it right over there.