retagged by
281 views

1 Answer

1 votes
1 votes
$The\ given\ equation\ can\ be\ written\ as\ T(n)=T(\sqrt{n})+c \\and\ let\ n=2^{_{k}} \\T(2^{k})=T(2^{k/2})+c \\S=T(2^k) \\S(k)=S(k/2)+c \\after\ solving\ we\ get \\O(log_{2}k) \\subsitute\ k=log_{2}n \\Complexity\ will\ be\ O(log_2log_2n)$
Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Jan 5, 2019
428 views
Which of the given options provides the increasing order of asymptotic complexity of functions $\text{f}_{1}, \text{f}_{2}, \text{f}_{3}$ and $ \text{f}_{4} $ ?$\text{f}_...
0 votes
0 votes
0 answers
2
admin asked Jan 5, 2019
207 views
The Adjacency matrix of a directed graph $\text{G}$ is given below.$\begin{array} {} & a & b & c & d & e & f & g & h & i \\ a & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ b & ...
0 votes
0 votes
1 answer
3
admin asked Jan 5, 2019
368 views
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is$\Theta(n ...
0 votes
0 votes
1 answer
4