This is Lecture 13 of the series of lectures on algorithms. In this video, I have explained the Forward Substitution method to solve Recurrence Relation.
In this series, we will study topics like
1. Finding the Time complexity of an algorithm (loops, recursive) using the counting method, tree method, and recurrence relation.
2. Algorithms paradigms ( Divide and conquer, greedy, dynamic programming, backtracking, etc..)

Hope you will enjoy it!!!
Thanks

свернуть