11 Computer Algorithms Lecture 6 Recurrence Ch. 4 (till Master Theorem) Some of these slides are courtesy of D. Plaisted et al, UNC and M. Nicolescu, UNR. - ppt download
Substitution method
Lecture 20: Recursion Trees and the Master Method
Solved Part 1 Q.1: Solve the following recurrence relations | Chegg.com
The Substitution method T(n) = 2T(n/2) + cn Guess:T(n) = O(n log n) Proof by Mathematical Induction: Prove that T(n) d n log n for d>0 T(n) 2(d n/2. -
algorithms - How to solve this recurrence $T(n) = 2T(n/2) + n\log n$ - Mathematics Stack Exchange
Solving T(n) = 2T(n/2) + log n with the recurrence tree method - Computer Science Stack Exchange