How to solve this recursion T(n) = 5T(n/2) + n^2 lg n using master's theorem?
Question
Problem 1.8 in MIT handout is the above recursion http://courses.csail.mit.edu/6.046/spring02/handouts/mastersol.pdf
Solution in the handout is T(n) = Θ(n^lg5) (case 1). I don't get any epsilon value which will satisfy the condition for case 1. Please help me out to solve this.
1 answers
solution1
0 ACCPTED 2016-03-14 17:29:46
lg n是O（n ^ 0.1）（任何正实数都会代替0.1），所以n ^ 2 lg n是O（n ^ 2.1），这满足2.1 <lg 5（2.32 ...）的要求。
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
How to solve equation T(n) = 5T(n/5) + sqrt(n), T(1) = 1, T(0) = 0 using recursion tree?
Solving the recurrence T(n) = T(n / 2) - T(n / 6) + O(lg n) using the master theorem method?
How to solve T(n) = 5T(n/2) + n^2, T(1) = 2 recursively
How to solve T(n) = 5T(n/2) + O(nlogn) using recursion
Solve recurrence relation using Master's method -> T(n) = 2T(n/2) + n^2 when n is even and T(n) = 2T(n/2) + n^3 when n is odd
Apply master theorem on T(n) = T(n/2) + n
How to solve the recurrence T(n) = T(n/2) + T(n/4), T(1) = 0, T(2) = 1 is T(n) = Θ(n lg φ ), where φ is the golden ratio?
How to solve: T(n) = T(n - 1) + n
How to calculate T(n) = 3T(n/3) + O(lg n)
How to solve T(n) = T(n-3)+n^2 using iteration?
Related Tags