# recurrence relation

248 views

T(n)=5 T ($\frac{n}{2}$+16) + n2

please tell the solution as i m getting confused

0
not sure, but if we can remove 16 considering it as a constant and apply master's?
it would be difficult to solve it other way
0

Yes I would agree with manisha11 .because there isn't any base condition given and apply back substitution would be tedious task.

What is the answer they have provided.$\\Theta(n^{2.32})$  ??

0
no we cannot remove it as a constant.
0

Any options and base condition?  LavTheRawkstar

0
You cannot solve this without a base condition.

n ^ 2.32

We can remove the constant........ Refer cormen page no. 84 chapter 4 topic- Making a Good Guess.

## Related questions

1
363 views
What is the time complexity of the following recurrence relation and step to derive the same $T(n) = T(\sqrt{n}) + log(logn)$
$T(n)=\sqrt{n} T(\sqrt{n})+100n$ Please solve this.
$T(n) = 2T(\sqrt{n}) + n$