What is recursion in C?
a) A function calling itself
b) A loop inside a function
c) A function returning multiple values
d) A function with multiple arguments
Answer:
a) A function calling itself
Explanation:
Recursion in C refers to the technique of a function calling itself to solve a smaller instance of the same problem. Recursive functions are typically used to solve problems that can be broken down into smaller, similar problems, such as calculating the factorial of a number or traversing a tree data structure. Each recursive call requires memory to store the function’s execution state, which is why recursion must have a base case to terminate the recursive calls and avoid infinite recursion.
Understanding recursion is important for solving complex problems that can be divided into simpler sub-problems and for recognizing when recursion is an appropriate solution.