Embedded Files
- Cormen, Leiserson, Rivest and Stein
- Exercise 1.2-2
- Exercise 1.2-3
- Problem 3-1
- Dasgupta, Papadimitriou and Vazirani
- Exercise 0.1.
- Exercise 0.2.
- Solve T(n) = 2 T(n-2) + 2, with n = 2k and for T(0) = 0, and T(0)= 1 by Recursive Substitution and the Graphical Method. (100 points)
- Complete the following table
Report abuse