Stack Exchange
Computer Science Stack Exchange
Questions
Tags
Users
About
Computer Science Stack Exchange
Public
Questions
Tags
Users
About
Find the asymptotic time complexity of the following
Asked
Aug 11 '19 at 06:18
Active
Aug 11 '19 at 06:18
Viewed
17 times
0
while(n>1){ n = sqrt(n); }
Where sqrt returns the root of n. n = 2^k and k is a power of 2.
algorithms
algorithm-analysis
asked Aug 11 '19 at 06:18
Aakash Dasgupta
1
0 Answers
0