UGC-NET | UGC NET CS 2018 Dec – II | Question 94

The solution of recurrence relation : T(n)=2T(sqrt(n))+lg(n) is
(A) O(lg (n) lg(n))
(B) O(lg (n))
(C) O(n lg (n))
(D) O(lg (n) lg(lg(n)))


Answer: (D)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.