This homework is not graded. It is practice for the XX November quiz.
Show the comparisions and exchanges made by the bad sorts, selection, insertion, and bubble, on the following input set of six values:
Show how quicksort will partition the following array of nine values into two parts. Show the exchanges and comparisions made in the partitioning. You may choose the pivot.
Show how the good sorts, shellsort, heapsort, and mergesort will sort the following list of eight values.