Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 2T(n-1)+1.
Fantastic news! We've Found the answer you've been seeking!
Question:
Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 2T(n-1)+1. Use the substitution method to verify your answer.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: