Problem
1. What initial order for a list of keys will produce the worst case for insertion sort in the contiguous version? In the linked version?
2. How many key comparisons and entry assignments does contiguous insertion sort make in its worst case?
3. Modify the linked version of insertion sort so that a list that is already sorted, or nearly so, will be processed rapidly