Recursion Algorithms – GeeksforGeeks
What is Recursion?
The process in which a function calls itself directly or indirectly is called recursion. Using a recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc.
What are Recursion Functions?
Recursive Functions are the corresponding functions that implement Recursion (Function calling itself) within them. A recursive function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems. Many more recursive calls can be generated as and when required.
Basics of Recursion Algorithms:
Recursion in different languages:
Standard Problems on Recursion
- Easy Problems on Recursion
- Medium Problems on Recursion
- Hard Problems on Recursion
Practice Sets on Recursion
Quiz based on Recursion
Last Updated :
23 Jun, 2023
Like Article
Save Article
What is Recursion?
The process in which a function calls itself directly or indirectly is called recursion. Using a recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc.
What are Recursion Functions?
Recursive Functions are the corresponding functions that implement Recursion (Function calling itself) within them. A recursive function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems. Many more recursive calls can be generated as and when required.
Basics of Recursion Algorithms:
Recursion in different languages:
Standard Problems on Recursion
- Easy Problems on Recursion
- Medium Problems on Recursion
- Hard Problems on Recursion
Practice Sets on Recursion
Quiz based on Recursion
Last Updated :
23 Jun, 2023
Like Article
Save Article