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)?

(A) \Theta(n ^ \log_5{3})
(B) \Theta(n ^ \log_3{5})
(c) \Theta(n Log n )
(D) \Theta( Log n )
(A) A
(B) B
(C) C
(D) D


Answer: (A)

Explanation: By Case 1 of the Master Method, we have T(n) = Theta(n ^ (log5(3)) ). [^ is for power]

Quiz of this Question



My Personal Notes arrow_drop_up