13 views
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+T(n-2) +n$.Use the substitution method to verify your answer.
| 13 views

1
2
3