Recurrence Relations · Recursive Algorithms
Lesson 5
The same analysis leads to the following relation: \[C(1)=1, \quad C(n)=2C(n-1)+n \ .\] We will soon learn how to solve this.
Recurrence Relations · Recursive Algorithms
The same analysis leads to the following relation: \[C(1)=1, \quad C(n)=2C(n-1)+n \ .\] We will soon learn how to solve this.