search
Log In
0 votes
248 views

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

please tell the solution as i m getting confused

in Algorithms 248 views
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.

1 Answer

0 votes
n ^ 2.32

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

Related questions

0 votes
1 answer
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)$
asked Jan 20, 2019 in Algorithms VikramRB 363 views
0 votes
1 answer
2
332 views
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
asked Jan 4, 2019 in Algorithms Mayankprakash 332 views
4 votes
3 answers
3
6 votes
1 answer
4
...