| Homework 5DetailsHomework 5Due February 7, 2006All problems are taken from Introduction to the Design and Analysis of Algorithms.Your work should be clear, concise, and in the order given.No scratched-out work, etc. should be present on your assignment.Illegible or messy work may result in a reduction in points. It is recommended that you learn and use some computer typesetting software (e.g. Word or LaTeX). Section | Page | Problem | Points | 2.4 | 77 | 8 | 4 | 2.4 | 78 | 9 | 4 | Recurrences1 | 12 | Total | 20 |
Notes: - Recurrences: Solve the following recurrenc relations. Make sure you show all of your work.
- T(n) = 2 T(n/2) + n3, T(1)=1
- T(n) = T(n - 1) + n, T(1)=1
- T(n) = T(n/2) + T(n/4) + T(n/8) + n2, T(1)=1
|