Recursion problem in algorithm

Posted by Marthin on Stack Overflow See other posts from Stack Overflow or by Marthin
Published on 2010-05-22T17:24:48Z Indexed on 2010/05/22 17:30 UTC
Read the original article Hit count: 188

Filed under:
|
|

I'm not sure if this is the right place to post this, but the problem actually belongs to a programming assignment.

Solve the recursion:

T(0) = 2;
T(n) = T(n-1) + 2;

Solution:

T(n) = 2(n+1)

Could someone please show me how they got to that solution?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about homework