🏁 Starts on Monday (20th May) - Join CAT 25-Week Rigorous Batch
Edit MetaData
Consider the following recurrence$$T(n)=2T(\sqrt{n})+1$$$$T(1) = 1$$Which of the following is true?
$$T(n)=O(\log \log n)$$
$$T(n)=O(\log n)$$
$$T(n)=O (\sqrt{n})$$
$$T(n) = O(n)$$
Create a FREE account and get:
Quant Based LR
DI Miscellaneous
Quant Based DI
Maxima-Minima
Table with Missing values
Scheduling
Charts
Data Interpretation Basics
Puzzles
Coins and Weights
Data Interpretation
Miscellaneous LR
Routes And Networks
Games and Tournamnents
Truth Lie Concept
2D & 3D LR
Data change over a period
DI with connected data sets
Arrangement
Selection With Condition
Venn Diagrams
Special Charts
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!