Q. Recursion is a process in which a function calls

A
Itself
B
Main () function
C
Another function
D
None of the above
Solution:
  • Recursion is a programming technique where a function calls itself to solve a smaller version of the same problem.
  • It involves breaking down a complex problem into smaller, more manageable subproblems.
  • The function continues to call itself until it reaches a base case, which stops the recursive calls and starts returning values.
  • Recursion is often used to solve problems that have a recursive or self-referential structure, like traversing trees or searching through nested data structures.
Entri PDF Icon

Get Question Bank

Strengthen Your Practice with our comprehensive question bank.

Entri Contact Image

Get Expert Advice for Free: Register for Your Free Consultation Now!