**Questions:**

- 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]

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

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

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

- 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]

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

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

- 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]

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