T(n)=T(n-1)+1 Recurrence relation substitution method problem1 in our ppt
Channel: JM
Date: 2021-05-09

Dear Students! 
Please see and solve the equation, After learning thoroughly.
step1: Guessing the solution
step2: Prove that the guessing is correct.
T(n)=T(n-1)+1 by applying mathematical induction solution for this recurrence relation is order of n..       i.e., O(n).
Share!Like! and Subscribe this channel.