Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
1 When n > 0, T(n) = T(n-1) + 1 In simple words: When n is more than 1, time taken to print n numbers in reverse is equal to time taken to printn-1 numbers in reverse, plus a constant time operation which is, in this case, printing the number n itself. And when n reaches 0, that is when base case