Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
.:T(n-1) = T(n-3) + 2 ...Let's call this equation 4 Now, SUBSTITUTE equation 4 in equation 1, we get: T(n) = [T(n-3) + 2] + 1 .:T(n) = T(n-3) + 3 ...Let's call this equation 5 So this says that after its third recursion, T(n) becomes T(n-3)+3. Before 1st recursion: T(n) = T(n-1)+1 Before 2nd