Swap-Nova / Understanding-Recursion

If a function is calling itself, it is called a recursive function. In this repo, we will view all the important techniques applied to perform a recursive function in an algorithm.

• The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function.
• Using recursive algorithm, certain problems can be solved quite easily.
• Examples of such problems are Towers of Hanoi (TOH), In-order/Pre-order/Post-order Tree Traversals, DFS of Graph, etc.