# Recurrence relation and Time Complexity [closed]

428 views
What is the time complexity of the following recurrence relation and step to derive the same

$T(n) = T(\sqrt{n}) + log(logn)$
closed with the note: Query resolved.

closed

Take $n=2^m$ then

$T(2^m)=T(2^{m/2})+\log m$

$\implies S(m)=S(m/2)+\log m$

Solve using master's theorem .$S(m)=O(\log ^2 m)=T(2^m)$

Put $m=logn \implies T(n)=(\log \log n)^2$
0
How did you derive the 3rd step, m = $2^{m}$ is understod but how $2^{m/2}$ written as m/2
1
We are not replacing $2^m \;by\; m$  but we are changing function T to S.

$T(2^m)\implies$  function of m.    (S(m))

$T(2^{m/2})\implies$  function of m/2.    (S(m/2))
0
can you please tell me $log^2(logn)$ and $(loglogn)^2$both are same??
0
Yes..same

## Related questions

1
983 views
recurrence relation for the functional value of F(n) is given below : $F(n) = a_{1}F(n-1) + a_{2}F(n-2) + a_{3}F(n-3) + ....... + a_{k}F(n-k)$ where $a_{i} =$ ... $O(k_{2}r^{k_{1}n})$) B. Linear ( $O(n)$ ) C. Logarithmic ( $O(\log n)$ ) D. $O(n \log n)$
What will be the time complexity for the following recurrence relation? $T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$ According to me it is $\Theta (n(logn)^{3})$ . Please confirm.
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused