Problem
1. Give a sequence of "compare-exchange" operations for sorting four records.
2. Which of the three elementary methods (selection sort, insertion sort, or bubble sort) runs fastest for a file which is already sorted?
3. Which of the three elementary methods runs fastest for a file in reverse order?