408 views

$T(n)=\sqrt{n} T(\sqrt{n})+100n$

| 408 views
0
is ans  $\Theta (100n)=\Theta (n)$?

then simply take $n=2^{m}$
0
i didn't get you sretha
0

ans is O(n log logn)

by
selected by
0
but @Magma
is master theorem applicable here?
See this https://gateoverflow.in/11211/how-to-find-the-complexity-of-t-n-t-sqrt-n-1
+1
thanks a lot. How did this substitution came to ur mind??
0
yes  ,mam masters theorem is applicable here

This is a special type of recurrence relation
+2

sushmita   I have  done this questions  earlier  on and note it down in my copy :p

because this is a special type of recurrence relation which is doing in this manner

This may suffice.

0
it will be O(n^loglogn)