Problem
1. Write a one-page guide to help a user of your computer system select one of our sorting algorithms according to the desired application.
2. A sorting function is called stable if, whenever two entries have equal keys, then on completion of the sorting function, the two entries will be in the same stable sorting methods order in the list as before sorting. Stability is important if a list has already been sorted by one key and is now being sorted by another key, and it is desired to keep as much of the original ordering as the new one allows. Determine which of the sorting methods of this chapter are stable and which are not. For those that are not, produce a list (as short as possible) containing some entries with equal keys whose orders are not preserved. In addition, see if you can discover simple modifications to the algorithm that will make it stable.