GitHub - 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.

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
50_1_Recursion		50_1_Recursion
50_1_Recursion.cpp		50_1_Recursion.cpp
50_Recursion		50_Recursion
50_Recursion.cpp		50_Recursion.cpp
52_Static_Global		52_Static_Global
52_Static_Global.cpp		52_Static_Global.cpp
53_Tail_Recursion		53_Tail_Recursion
53_Tail_Recursion.cpp		53_Tail_Recursion.cpp
54_Head_Recursion		54_Head_Recursion
54_Head_Recursion.cpp		54_Head_Recursion.cpp
55_Tree_Recursion		55_Tree_Recursion
55_Tree_Recursion.cpp		55_Tree_Recursion.cpp
57_Indirect_Recursion		57_Indirect_Recursion
57_Indirect_Recursion.cpp		57_Indirect_Recursion.cpp
59_Nested_Recursion		59_Nested_Recursion
59_Nested_Recursion.cpp		59_Nested_Recursion.cpp
62_Sum_Recursion		62_Sum_Recursion
62_Sum_Recursion.cpp		62_Sum_Recursion.cpp
64_Factorial		64_Factorial
64_Factorial.cpp		64_Factorial.cpp
66_Power_Recursion		66_Power_Recursion
66_Power_Recursion.cpp		66_Power_Recursion.cpp
67_Taylor_Series		67_Taylor_Series
67_Taylor_Series.cpp		67_Taylor_Series.cpp
72_Fibonacci		72_Fibonacci
72_Fibonacci.cpp		72_Fibonacci.cpp
74_nCr		74_nCr
74_nCr.cpp		74_nCr.cpp
76_Tower_of_Hanoi		76_Tower_of_Hanoi
76_Tower_of_Hanoi.cpp		76_Tower_of_Hanoi.cpp
README.MD		README.MD
dummy		dummy
dummy.cpp		dummy.cpp
dummy2		dummy2
dummy2.cpp		dummy2.cpp
indirect		indirect
nested		nested
tempCodeRunnerFile.cpp		tempCodeRunnerFile.cpp
tree		tree

Provide feedback