Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
The solution of recurrence relation: T(n)=2T(sqrt(n)) + lg(n) is
1
O(lg (n) lg(n))
2
O(lg (n))
3
O(n lg (n))
4
O(lg (n) lg(lg(n)))