Indirect Recursion
In this recursion, there may be more than one functions and they are calling one another in a circular manner.
From the above diagram fun(A) is calling for fun(B), fun(B) is calling for fun(C) and fun(C) is calling for fun(A) and thus it makes a cycle.
Recursion Notes for GATE Exam [2024]
This Recursion Notes for the GATE Exam provides a comprehensive guide to one of the fundamental concepts in computer science, recursion, specifically tailored for those preparing for the Graduate Aptitude Test in Engineering (GATE). Recursion is a powerful problem-solving technique where a function calls itself during its execution, and it plays a significant role in algorithm design and programming.
Table of Content
- Introduction to Recursion
- Need of Recursion
- Types of Recursion
- Direct Recursion
- Indirect Recursion
- Gate Previous Year Problems on Recursion