Tail Recursion Vs Non-Tail Recursion
In tail recursion, no other operation is performed after the recursive function call, while in non-tail recursion, an operation is performed on the calculated value.
Introduction to Recursion
Recursion is a powerful algorithmic technique (divide-and-conquer strategy) in which a function calls itself (either directly or indirectly) on a smaller problem of the same type in order to simplify the problem to a solvable state. 1. What is Recursion? Recursion is an approach for the problems that can be …