Questions:

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

2. Why do we need the extra step of replacing the smallest number with MAX?   [Answer]

3. What does MAX represent and why is it an appropriate marker?   [Answer]

4. State the comparisons the Simple Sort would make to find the smallest number in this list: [3 8 9 1 5 4].   [Answer]

5. How many comparisons must a computer using the Simple Sort make to be certain of selecting the smallest number from a list of 7 numbers? of 10 numbers?   [Answer]

6. What operation does the Simple Sort use to move numbers from the unsorted list to the sorted list?   [Answer]

7. How many times does the Simple Sort use the copy operation when sorting a list of 7 numbers? of 9 numbers?   [Answer]

8. How many iterations (i.e. loops through steps 3 - 6) does the algorithm make when sorting a list of 7 numbers? of 12 numbers?   [Answer]

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