Insertion Sort

• Insertion Sort “divides” the array into two portions: a sorted portion and an unsorted portion.
• Initially the entire array is considered unsorted.
• There is nothing to compare the element at index 0 to so it is simply added to the sorted portion of the array.