engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Consider the recurrence function \(T\left( n \right) = \left\{ {\begin{array}{*{20}{c}} {2T\left( {\sqrt n } \right) + 1,\;\;\;n > 2}\\ {2,\;\;\;0 < n \le 2} \end{array}} \right.\) Then T(n) in terms of Θ notation is
1
Θ (log log n)
2
Θ (log n)
3
Θ (√n)
4
Θ (n)