Recursion problem in algorithm
- by Marthin
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?