Insertion sort divides the list into how many parts?

1. One part is already in order and one is not. 2. Elements move from the second to the first. 3. In insertion sort the list is divided into two parts, sorted and unsorted. 4. So the answer is two. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_