The problem numbers refer to the textbook on Jeff Erickson's algorithms page. Optimize the running time for the first two problems. For the remaining problems, there is no need to optimize running time.
  1. Exercise 33 (a) of Chapter 1 (Recursion). (10 points)
  2. Exercise 37 of Chapter 1. (10 points)
  3. Exercise 1 (a,b) of Chapter 2 (Backtracking). (10 points)
  4. Exercise 2 (a,b) of Chapter 2. (10 points)
  5. Exercise 3 (a) of Chapter 2. (10 points)

The homework is due in class on Thursday, February 13. Please pay attention to the policy on collaboration outlined in the syllabus. In particular, you will get the most out of home work if either you work on your own or collaborate with a fellow student or two in a reasonable way. We will evaluate the originality of your writing while reviewing your work.