What is recursion and why is it often discouraged for beginners?

• A. Recursion is a loop that repeats until memory runs out
• B. Recursion is a function calling itself to solve a problem; can be hard to reason about and may cause stack overflow if not careful
• C. Recursion is a type of data structure
• D. Recursion always runs faster than iteration

Answer: (B)

Recursion is when a function calls itself to solve a problem by breaking it down into smaller versions of itself, with a base case that stops the repeating calls. This way the problem is solved step by step, as each call handles a smaller piece and eventually reaches the point where it can return a result.

Why this is often avoided for beginners is because you have to keep track of many layers of function calls at once. Each call adds a new set of variables on the call stack, so reasoning about how the final result emerges requires imagining several levels of progress happening simultaneously. If the base case isn’t set up correctly or the problem depth gets too large, you can exhaust memory or crash with a stack overflow. For beginners, loops and straightforward, linear code are usually easier to read and debug, making iteration a safer starting point. Recursion is still valuable for certain problems, but it’s important to understand how the stack grows and to ensure the base case is correct before using it.