Section 23.2 Check Point Questions3 questions
23.2.1
Describe how an insertion sort works. What is the time complexity for an insertion sort?
23.2.2
Use Figure 23.1 as an example to show how to apply an insertion sort
on {45, 11, 50, 59, 60, 2, 4, 7, 10}.
23.2.3
If a list is already sorted, how many comparisons will the insertionSort method perform?