Insertion sort works by taking an item from the unsorted portion of the array, and placing it into it's correct value in the sorted portion, building the sorted array.