GATE | CS | 2017 | Set 2 | Algorithms | Recurrence | Question 56

Last Updated :
Discuss
Comments
Gate_4

Find the complexity

θ(log log n)

θ(log n)

θ(sqrt(n))

θ(n)

This question is part of this quiz :

GATE-CS-2017 (Set 2),Algorithms GATE CS PYQ Quiz,Recurence GATE CS PYQ Quiz
Tags:
GATE
Algorithms
GATE CS
Share your thoughts in the comments