Assignment #2 due Feb. 20

1. A sorting algorithm is defined as stable if equal elements are in the same relative order in the sorted sequence as in the original sequence. Which of insertion sort, quicksort, selection sort, and mergesort are stable, and which are unstable. Give a simple fix to make the unstable sorts stable.
2. CLR 8.3-4
3. CLR 8.4-1
4. CLR 8-2
5. CLR 8-4
6. CLR 16.3-4
7. CLR 16-1
8. CLR 16-2