Question: Consider the recurrence equation, T(n) = 2T(n 1) + 1, for n > 1, where T(n) = 1 forn= 1. Prove that T(n) is O(2).
Consider the recurrence equation,

T(n) = 2T(n 1) + 1, for n > 1, where T(n) = 1 forn= 1. Prove that T(n) is O(2").
Step by Step Solution
3.40 Rating (188 Votes )
There are 3 Steps involved in it
Given Tn 2Tn1 1 for n 1 Tn 1 We will solve this using substitution method Tn ... View full answer
Get step-by-step solutions from verified subject matter experts
