Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
step, then before its second recursion step, T(n) becomes T(n) = T(n-2) + 2. Simple, no? So how much does T(n) become before third recursion? And before fourth? Before fifth? And also, how many times does it even have to recurse? The answer is that it recurses till it reaches its base case of