Questions:

  1. What changes need to be made to the Insertion Card Sort algorithm so that it can be used to sort numbers on a computer?    [Answer]

  2. What operation does the Insertion Sort use to move numbers from the unsorted section to the sorted section of the list?   [Answer]

  3. Consider the following lists of partially sorted numbers. The double bars represent the sort marker. For each list state how many comparisons and swaps are needed to sort the next number.   [Answer]
    1. [1 3 4 8 9 || 5 2]
    2. [1 3 4 5 8 9 || 2]
    3. [1 3 || 4 9 2 8 ]
    4. [1 2 3 8 || 7 6]
    5. [2 3 4 6 7 8 9 || 1]

  4. How can we rewrite the Insertion Sort algorithm so that it sorts numbers from highest to lowest?   [Answer]