retagged by
829 views

1 Answer

0 votes
0 votes

Ans is A.

In these type questions where √  is given take n= 2^m

so, √ n =2^(m/2)

now substitute the respective powers of n for m

T(m) =T(m/2) + logm

Solving by Master's Theorem u get-->

log m * log m

now replacing m by log n (since n= 2^m) we get

θ (log log n) ^2  as ans..

Related questions

2 votes
2 votes
1 answer
1
Deepak Yadav asked Jan 6, 2017
428 views
Solve this problem?
0 votes
0 votes
2 answers
3
Rustam Ali asked Sep 3, 2018
855 views
Find time complexity of below Program?A(n){if(n<=1) return;elsereturn $A(\sqrt{n})$ ;}
0 votes
0 votes
1 answer
4
Sumit Singh Chauhan asked Aug 18, 2018
3,399 views
What is time complexity of fun()?int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count;}(A) O(n^...