Questions:

  1. Why did the Simple Sort require the least amount of copies?    [Answer]

  2. How does the Simple Sort illustrate the time-space tradeoff?   [Answer]

  3. Why did the Simple Sort require many more comparisons that the other two sorts?   [Answer]

  4. Of the three sorts you learned, is the Selection Sort always the most time-efficient sort?   [Answer]

  5. For each of the following lists, determine the number of comparisons and swaps the Insertion Sort and the Selection Sort require.   [Answer]
    1. [2 4 6 9 3 1]
    2. [2 3 6 9 8]
    3. [9 8 7 6 1]
    4. [1 2 6 5 9]