- #1
22990atinesh
- 143
- 1
Homework Statement
##T(n) = 2 T(n-1) + n, n \geq 2##
##T(1) = 1##
Homework Equations
The Attempt at a Solution
I'm using recursion tree method to solve the above recurrence
T(n) = Summation of non-leaf nodes + leaf nodes
##T(n) = n + 2(n-1) + 2^2(n-2) + ... + 2^{n-1}##