1. Problem 8.1-1 (3 points)
2. Problem 8.1-2 (2 points)
3. Problem 8.2-1 (3 points)
4. Problem 8.3-1 (3 points)
5. Problem 8.4-1 (4 points)
6. Problem 9.1-4 (4 points)
7. Problem 9.2-1 (3 points)
8. Problem 9.2-3 (4 points)
9. Problem 9.3-2 (4 points)
10. Problem 9.4-1 (3 points)

11. (30 points) For the following sorting algorithms: insertion sort, merge sort, heap sort, quicksort, counting sort, radix sort, and bucket sort:

1. Implement each algorithm (include source code with your assignment)
2. Using either U[0,k) integers or U[0,1) reals as your inputs to the above sorting algorithms, compute the running time of your implementations for 10 different samples of length N=10, 50, 100, 500, 1000, 5000, 10000, 50000, 100000, 500000, and 1000000. Plot your results.

This assignment can be done cooperatively in groups of no more than 7 people. If done cooperatively, please include a list of all the members of your group on your assignment.

Due in recitation, 26 October.