• Recursion is a process that happens when a function calls a copy of itself to work on any smaller problem.
• Any function that calls itself repeatedly is called a recursive function. Such calls are called recursive calls.
• Recursion involves several recursive calls.
• Recursion cannot be applied to all the problems, it is useful for the tasks that can be defined in terms of subtasks.
• Problems that are best suited and that can be solved using Recursion are: Tower of Hanoi, Fibonacci Series, factorial finding, etc.

How does Recursion work