Solve the Recurrence T(n) = T(n-1) + n (Forward Substitution Method)
This video explains the Forward Substitution Method of Recurrence Relation.
It solves recurrence relation T(n) = T(n-1) + n using Forward Substitution Method.
There are many methods to solve the recurrence relation
(1) Iteration method
(2) Master method (Master Theorem)
(3) Recursion-tree method
(4) Substitution method
But Substitution method has two type (1) Forward Substitution and (2) Backward Substitution
Forward substitution method use the Induction to solve the recurrence relation.
Thanks