Insertion sort splits the list into two parts: a sorted part on the left and an unsorted part on the right. Each pass takes the first item from the unsorted part and inserts it into the correct place in the sorted part. The sorted part grows by one item every pass.