Open In App
Related Articles

Recursion Algorithms

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
DSA for Beginners Learn more about Recursion in DSA Self Paced Course

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.

Recursion-Algorithm.png

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

Practice Sets on Recursion

Quiz based on Recursion



Last Updated : 26 Jul, 2023
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads