- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Last Updated :
Discuss
Comments
Consider the following recurrence.
T(n) = T([Tex]\\sqrt{n}[/Tex]) + [Tex]\\Theta(Log Log n)[/Tex]
What is the value of recurrence?
(A) [Tex]\\Theta( (Log Log n) ^ 2)[/Tex]
(B) [Tex]\\Theta(Log Log n)[/Tex]
(B) [Tex]\\Theta(n)[/Tex]
(B) [Tex]\\Theta(Log Log Log n)[/Tex]
(A) [Tex]\\Theta( (Log Log n) ^ 2)[/Tex]
(B) [Tex]\\Theta(Log Log n)[/Tex]
(B) [Tex]\\Theta(n)[/Tex]
(B) [Tex]\\Theta(Log Log Log n)[/Tex]
A
B
C
D
This question is part of this quiz :
Top MCQs on Complexity Analysis using Recurrence Relations with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
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