Need Help solving Recurrence Problem

Asked Aug 04 '16 at 05:56

Active Aug 04 '16 at 05:56

Viewed 9 times

I have this practice problem that I was given.

I am trying to solve a specific recurrence equation

T(n) = 4 when n <= 2 

T(n) = 3T(n/3) + 5 when n > 2

how would i go about to solve such a problem since I only really know how to solve Master Theorem and Divide and Conquer using the a and b but don't really know how to solve a problem like this.

I'm trying to get an exact answer as well

asked Aug 04 '16 at 05:56

johnny

Welcome to [cs.SE]! Your question is a very basic one. Since you did not include much of an attempt to solve it on your own, we have little to work with. Let me direct you towards our reference question which cover your problem in detail. This can be solved immediately using the Master theorem. – D.W. Aug 04 '16 at 06:05
I suggest you work through the material there, try to solve your problem again, and if you're still stuck, edit to include your attempts along with the specific problems you encountered. Good luck! – D.W. Aug 04 '16 at 06:05
Incidentally, I encourage you to create an account. Also, if you've created multiple accounts here, I encourage you to merge them. – D.W. Aug 04 '16 at 06:08

Need Help solving Recurrence Problem

0 Answers0