Thanks for the answer. I am having a little difficulty in understanding. Please have a look at my answer using Master Theorem.

3 votes

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) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$

According to me it is $\Theta (n(logn)^{3})$ . Please confirm.

3 votes

2

1

when you reduce size of subproblem by log in s function why you have not taken log of m^2.

it should be **,P(m)=8P(m/2)+2logm/m**