Question 4983 – Algorithms
November 26, 2023UGC NET CS 2013 Sep-paper-2
November 26, 2023Question 4992 – Algorithms
The solution of recurrence relation : T(n)=2T(sqrt(n))+lg(n) is
Correct Answer: D
Question 286 Explanation:

T (n) = l og log (n) · l og (n)
T (n) = l og(n) · l og log (n)
O(lg (n) lg(n))
O(lg (n))
O(n lg (n))
O(lg (n) lg(lg(n)))
Subscribe
Login
0 Comments