Analyzing an algorithm with recurrence T(n) = T(n - 1) + T(n - 2) + c?

user_6514011 0
Viewed 224

I know that this type of equations can be solved by many methods, but I want to use to use recurrence tree method to solve the equation.Can anyone show me how it is done by recurrence tree method?

asymptotic-complexity recursion big-o time-complexity algorithm
1 Answers
Related