Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Consider the following recurrence.
T(n) = T() +
What is the value of recurrence?
Explanation: Change of variables: let m = lg n. Recurrence becomes S(m) = S(m/2) + theta(lgm). Case 2 of master’s theorem applies, so T(n) = theta( (log Log n) ^ 2).
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...