| Problem | Notes | Grading
|
|---|
| 4-12 | Prove that your algorithm has the specified complexity. Also, see the heading right above the problem. It may give you a hint about how you might want to approach the problem. | Algorithm Rubric
|
| 4-18 | You should be able to do this in place (i.e. with a constant amount of extra memory). Prove that your algorithm has the specified complexity. | Algorithm Rubric
|
| 4-28 | This one is really not that hard if you use some of your math skills. | Computational Problem Rubric
|
| 4-32 | You are not limited to 20 questions. They just use that as a setup for the problem. For both parts, specify exactly how many questions are necessary as a function of n (not just a bound). | Algorithm Rubric |