Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Analysis of Algorithms (Recurrences) | Question 11

Improve Article
Save Article
  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

Consider the following recurrence.

T(n) = T(\sqrt{n}) + \Theta(Log Log n)

What is the value of recurrence?

(A) \Theta( (Log Log n) ^ 2)
(B) \Theta(Log Log n)
(B) \Theta(n)
(B) \Theta(Log Log Log n)

(A) A
(B) B
(C) C
(D) D


Answer: (A)

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
Related Articles
1. Algorithms | Analysis of Algorithms (Recurrences) | Question 2
2. Algorithms | Analysis of Algorithms (Recurrences) | Question 3
3. Algorithms | Analysis of Algorithms (Recurrences) | Question 4
4. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
5. Algorithms | Analysis of Algorithms (Recurrences) | Question 6
6. Algorithms | Analysis of Algorithms (Recurrences) | Question 7
7. Algorithms | Analysis of Algorithms (Recurrences) | Question 8
8. Algorithms | Analysis of Algorithms (Recurrences) | Question 9
9. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
10. Algorithms | Analysis of Algorithms (Recurrences) | Question 1
Previous
Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Next
Algorithms | Analysis of Algorithms (Recurrences) | Question 1
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty : Basic
Article Tags :
Report Issue
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox

Start Your Coding Journey Now!