The insertion sort builds a sorted list from the start of the unsorted list. It loops through the remaining unsorted items in the list; each time through, it grabs the next unsorted item, and then loops back through the sorted part of the list to find the correct spot for the current unsorted item. After it finds the correct spot, it "inserts" the item into that spot.