Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Consider the following recurrence
T(n) = 3T(n/5) + lgn * lgn
What is the value of T(n)?
Explanation: By Case 1 of the Master Method, we have T(n) = Theta(n ^ (log5(3)) ). [^ is for power]
Quiz of this Question