Open In App
Related Articles

Recursion Algorithms

Improve Article
Save Article
Like Article

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.


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

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated : 26 Jul, 2023
Like Article
Save Article
Similar Reads
Complete Tutorials