Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
T(0)=1. But in how many recursion steps will T(n) reach T(0)? We’ll answer these questions in a while. For now, let’s try to find out what T(n) becomes before its third recursion: From equation 3, T(n) = T(n-2) + 2 Let's SUBSTITUTE n-1 in place of n in equation 3, we get: T(n-1) = T((n-1)-2) + 2