What is complexity of [math]T(n) = 2T(n/2) + n^2[/math]? - Quora
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. -
1 Solving recurrences
How to resolve recurrence t(n) =2t(n/2) +n/logn - Quora