Recursion vs Iteration When Each Wins in DSA C++ - Build Both Approaches

Recursion vs Iteration: When Each Wins

📖 Scenario: Imagine you are helping a chef organize recipes. Some recipes are simple and repeat steps many times, while others have steps that call themselves again and again. You want to understand when to use repeating loops (iteration) and when to use recipes that call themselves (recursion).

🎯 Goal: You will create two ways to calculate the factorial of a number: one using recursion and one using iteration. Then, you will compare their outputs to see they give the same result.

📋 What You'll Learn

Create a variable number with the value 5

Write a recursive function factorial_recursive that calculates factorial

Write an iterative function factorial_iterative that calculates factorial

Print the results of both functions for number

💡 Why This Matters

🌍 Real World

Understanding when to use recursion or iteration helps in writing efficient code for tasks like searching, sorting, and processing data structures.

💼 Career

Many programming jobs require choosing the right approach for algorithms to optimize speed and memory, especially in interviews and system design.

1

Create the input number

Create an integer variable called number and set it to 5.

DSA C++

# Your code here

Hint

Use int number = 5; to create the variable.

2

Write the recursive factorial function

Write a recursive function called factorial_recursive that takes an integer n and returns the factorial of n. Use the base case if (n == 0) return 1; and the recursive call return n * factorial_recursive(n - 1);.

DSA C++

int number = 5;
// Write factorial_recursive function here

Hint

Remember the factorial of 0 is 1. For other numbers, multiply n by factorial of n-1.

3

Write the iterative factorial function

Write an iterative function called factorial_iterative that takes an integer n and returns the factorial of n. Use a for loop from 1 to n multiplying a result variable.

DSA C++

int number = 5;

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

// Write factorial_iterative function here

Hint

Start with result = 1. Multiply it by each number from 1 to n in a loop.

4

Print the factorial results

Print the factorial of number using both factorial_recursive and factorial_iterative functions. Use std::cout to print the results on separate lines.

DSA C++

int number = 5;

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

int factorial_iterative(int n) {
    int result = 1;
    for (int i = 1; i <= n; i++) {
        result *= i;
    }
    return result;
}

// Print factorial results here

Hint

Use std::cout << factorial_recursive(number) << std::endl; and similarly for factorial_iterative.

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