Thread: Help about recursion

Originally Posted by Figen

0,2,8,26,80,242,728,2186,6560,19682....how can i write these series with recursion?
if we start k=0 and then return the function 3k+2 we can get that but I don't know how to turn this into code,can you help me about that?

First of all, the mods here take a rather dim view of people using us to do their homework.

You really need to make your best effort on this, on your own, and if you run into problems post your code (in code tags please) and we'll see what we can do...

FWIW... you don't actually need recursion to solve this problem...

Mathematically

Code:

f(k) = 3 * f(k-1) + 2;  k > 0
f(0) = 0;

Edit: Just apply what tabstop said.

Originally Posted by CommonTater

FWIW... you don't actually need recursion to solve this problem...

I think the hook here is to do it with recursion. I think he would've come up with some other way to implement it if his job was just to implement that series.

Originally Posted by fronty

I think the hook here is to do it with recursion. I think he would've come up with some other way to implement it if his job was just to implement that series.

I figured it was an assignment for some course or another.

It's just that recursion is, to say the least, not the safest way of doing things where you have another choice on hand.