This assignment is worth a total of 50 points.
All homework will be submitted electronically, using the curator system. You may submit your homework in any format that can be opened using Microsoft Word (including plain ASCII text). If you submit more than one version of your homework, we will store all submissions, but will actually grade the latest one. Make sure that your file contains at the top your name, your ID number, and your email address.
Where a question number is used, it refers to a question from the textbook.
1. Exercise 6.7
2. Exercise 6.13
3. Exercise 7.6, but only for the following algorithms: Insertion Sort, Quicksort, Mergesort, and Radix Sort.
4. Exercise 7.8, you must show how you derived your answer, or how it will cause the worst case behavior via a trace of the algorithm passes.
5. Exercise 8.8, parts (a), (b), and (d)