Recursion vs Iteration When Each Wins in DSA C++ - Key Differences

Recall & Review

beginner

What is recursion in programming?

Recursion is when a function calls itself to solve smaller parts of a problem until it reaches a simple case it can solve directly.

beginner

What is iteration in programming?

Iteration means repeating a set of instructions using loops like for or while until a condition is met.

intermediate

When is recursion better than iteration?

Recursion is better when the problem is naturally divided into similar smaller problems, like tree traversals or divide and conquer algorithms.

intermediate

When is iteration better than recursion?

Iteration is better when you want to save memory and avoid the overhead of function calls, especially for simple loops or when the problem does not break down naturally.

beginner

What is a risk of using recursion too deeply?

Using recursion too deeply can cause a stack overflow error because each function call uses memory on the call stack.

Which of these problems is best solved using recursion?

A Calculating factorial of a number

B Summing numbers from 1 to 100

C Printing numbers from 1 to 10

D Finding the maximum in a list using a loop

Factorial calculation naturally breaks down into smaller factorial problems, making recursion a good fit.

What is a main disadvantage of recursion compared to iteration?

A Always slower than iteration

B Cannot solve complex problems

C Uses more memory due to function call stack

D Does not work with loops

Recursion uses extra memory for each function call on the call stack, which iteration avoids.

Which method is usually more efficient in terms of memory?

A Recursion

B Depends on the programming language

C Both use the same memory

D Iteration

Iteration uses constant memory for loops, while recursion uses extra memory for each call.

Which of these is a sign that recursion is a good choice?

A Problem can be divided into smaller similar problems

B Problem requires simple repeated steps

C Problem needs to run very fast

D Problem has no base case

Recursion works well when the problem breaks down into smaller similar problems.

What happens if a recursive function has no base case?

A It throws a syntax error

B It runs forever and causes stack overflow

C It converts to iteration

D It automatically stops after some calls

Without a base case, recursion never stops and causes a stack overflow error.

Explain when you should choose recursion over iteration and why.

Think about problems that repeat the same pattern on smaller parts.

Describe the main risks or downsides of using recursion.

Consider what happens inside the computer when functions call themselves.

Practice

1. Which scenario is best suited for using recursion instead of iteration?

easy

A. When the problem can be divided into similar smaller subproblems

B. When you need to process a large list without stack overflow risk

C. When you want to avoid function call overhead

D. When the problem requires simple repeated loops

Solution

1. Step 1: Understand recursion use case

   Recursion works well when a problem can be broken down into smaller versions of itself, like tree traversals or factorial calculation.

2. Step 2: Compare with iteration scenarios

   Iteration is better for simple repeated tasks without nested subproblems, so recursion is preferred for divide-and-conquer problems.

3. Final Answer:

   When the problem can be divided into similar smaller subproblems -> Option A

4. Quick Check:

   Recursion fits divide-and-conquer problems [OK]

Hint: Recursion fits problems breaking into smaller similar parts [OK]

Common Mistakes:

• Thinking iteration is always better
• Ignoring stack overflow risk in recursion
• Confusing recursion with simple loops

2. Which of the following is the correct syntax to write a recursive function in C++?

easy

A. void func() { if(condition) func(); }

B. void func() { func(); }

C. void func() { while(true) func(); }

D. void func() { for(int i=0; i<10; i++) func(); }

Solution

1. Step 1: Identify base case in recursion

   Recursive functions must have a condition to stop calling themselves, usually an if statement.

2. Step 2: Check options for base case usage

   void func() { if(condition) func(); } uses if(condition) to control recursion, preventing infinite calls. Others cause infinite recursion or loops.

3. Final Answer:

   void func() { if(condition) func(); } -> Option A

4. Quick Check:

   Recursion needs a stopping condition [OK]

Hint: Recursive functions must have a stopping condition [OK]

Common Mistakes:

• Writing recursion without base case
• Using loops inside recursion incorrectly
• Confusing infinite loops with recursion

3. What is the output of the following C++ code?

int factorial(int n) {
  if (n == 0) return 1;
  return n * factorial(n - 1);
}

int main() {
  std::cout << factorial(4);
  return 0;
}

medium

A. Error: infinite recursion

B. 10

C. 120

D. 24

Solution

1. Step 1: Trace factorial calls

   factorial(4) calls factorial(3), factorial(2), factorial(1), factorial(0). factorial(0) returns 1.

2. Step 2: Calculate return values

   factorial(1) = 1*1=1, factorial(2)=2*1=2, factorial(3)=3*2=6, factorial(4)=4*6=24.

3. Final Answer:

   24 -> Option D

4. Quick Check:

   4! = 24 [OK]

Hint: Factorial n! = n*(n-1)! with base case 0! = 1 [OK]

Common Mistakes:

• Confusing factorial with sum
• Missing base case causing infinite recursion
• Incorrect multiplication order

4. Identify the error in this recursive function to compute the sum of numbers from 1 to n:

int sum(int n) {
  if (n == 1) return 1;
  return n + sum(n);
}

medium

A. Missing base case

B. Recursive call does not reduce n, causing infinite recursion

C. Should use a loop instead of recursion

D. Function should return void

Solution

1. Step 1: Check base case correctness

   The base case is correct: if n == 1, return 1.

2. Step 2: Analyze recursive call argument

   The recursive call is sum(n), which does not reduce n, so it calls itself infinitely without progress.

3. Final Answer:

   Recursive call does not reduce n, causing infinite recursion -> Option B

4. Quick Check:

   Recursive calls must reduce problem size [OK]

Hint: Recursive calls must progress toward base case [OK]

Common Mistakes:

• Not reducing argument in recursion
• Confusing base case with recursive step
• Assuming recursion always works without checks

5. You want to process a large dataset with millions of elements. Which approach is better and why?

A recursive function that processes one element and calls itself for the rest,
or an iterative loop that processes elements one by one?

hard

A. Recursive approach, because it uses less memory

B. Recursive approach, because it is easier to write

C. Iterative approach, because recursion risks stack overflow with large data

D. Both are equally good for large datasets

Solution

1. Step 1: Understand recursion limits

   Recursion uses the call stack for each call, which is limited and can overflow with millions of calls.

2. Step 2: Compare iteration benefits

   Iteration uses a single loop and constant stack space, making it safer and more efficient for large datasets.

3. Final Answer:

   Iterative approach, because recursion risks stack overflow with large data -> Option C

4. Quick Check:

   Iteration avoids stack overflow in large data [OK]

Hint: Use iteration for large data to avoid stack overflow [OK]

Common Mistakes:

• Assuming recursion is always simpler
• Ignoring stack size limits
• Thinking recursion uses less memory