Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
function printReverse(n) { // If this takes T(n) time to execute if(n == 0) return // This is a constant time operation = 1 console.log(n) // This is a constant time operation = 1 printReverse(n-1) // This takes T(n-1) time to execute } And since, T(n)=summation of all the functions of times