• retagged by
1,284 views

1 Answer

0 0 votes
$T(n)=3T(\sqrt{n})+logn$

Let : $n=2^k$

$T(2^k)=3T(2^{k/2})+log2^k$

Replacing : $T(2^k)=S(k)$

$S(k)=3S(\frac{k}{2})+k$

Using Master theorem :

$S(k)=\Theta(k^{1.58})$

$T(2^k)=\Theta(k^{1.58})$

$k=logn$

$T(n)=\Theta((logn)^{1.58})$
Position:
Show:

Related questions

0 0 votes
0 0 answers
393
393 views
akash.dinkar12 asked Apr 5, 2019
393 views
Use a recursion tree to give an asymptotically tight solution to the recurrence $T(n)=T(\alpha n) +T((1-\alpha)n) +cn$,where $\alpha$ is a constant in the range $0<\alpha...
0 0 votes
0 0 answers
665
665 views
akash.dinkar12 asked Jun 28, 2019
665 views
Show that in the recurrence$T(n)=\max_{0<q\leq n-1} (T(q)+T(n-q-1))+\Theta(n)$$T(n)=\Omega(n^2)$
0 0 votes
0 0 answers
507
507 views
akash.dinkar12 asked Apr 5, 2019
507 views
Show that case 3 of the master theorem is overstated, in the sense that the regularity condition $af(n/b)\geq cf(n)$ for some constant $c<1$ implies that there exists a c...
0 0 votes
0 0 answers
394
394 views
akash.dinkar12 asked Apr 5, 2019
394 views
Show that if $f(n)=\Theta(n^{log_ba}\lg^kn )$, where $k\geq0$ then the master recurrence has solution $T(n) =\Theta(n^{log_ba} \lg^{k+1}n)$.For simplicity, confine your a...