Can someone help solve recurrence relation?

Asked Feb 09 '14 at 20:18

Active Feb 09 '14 at 21:54

Viewed 22 times

It says to solve the recurrence exactly for n a power of 2.

T(n) = {1}, if n = 1

T(n) = {5T(n/2) + (n lg n)^2, otherwise

I'm supposed to use Θ notation to express my answer.

Normally I would try to look for the characteristic equation but for this one I'm lost.

Is this the first step?

T(n) - 5T(n/2) = (n lg n )^2

This is not a duplicate as it has not been posted there.

edited Feb 09 '14 at 21:54

asked Feb 09 '14 at 20:18

user127259

This is not a duplicate. I fail to see where my question was asked on that post. – user127259 Feb 09 '14 at 21:48
If you skip down to the answer that talks about the Master Theorem, you'll find that it is appropriate for your problem. – Rick Decker Feb 09 '14 at 23:40

0 Answers0