2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4
909.4K views on YouTube
Recurrence Relation for Decreasing/ Subtracting Functions
Example : T(n) = 2 T(n-1) +1
Courses on Udemy
================
Java Programming
https://www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6
Data Structures using C and C++
https://www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D
C++ Programming
https://www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225