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

Recursion vs Iteration: When Each Wins

📖 Scenario: Imagine you are helping a friend understand two ways to solve problems: recursion and iteration. You will create simple examples to see how each works and when one might be better than the other.

🎯 Goal: You will build two methods to calculate the factorial of a number: one using recursion and one using iteration. Then, you will compare their outputs to understand when each method is useful.

📋 What You'll Learn

Create a recursive method called FactorialRecursive that calculates factorial

Create an iterative method called FactorialIterative that calculates factorial

Use a variable called number set to 5

Print the results of both methods clearly

💡 Why This Matters

🌍 Real World

Understanding recursion and iteration helps solve many programming problems like searching, sorting, and navigating data structures.

💼 Career

Many software jobs require knowing when to use recursion or iteration for efficient and clear code.

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 method

Write a method called FactorialRecursive that takes an integer n and returns the factorial using recursion. Use the base case when n is 1, return 1; otherwise return n * FactorialRecursive(n - 1).

DSA C#

int number = 5;

// Write the recursive method FactorialRecursive below

Hint

Use a method with a base case for n == 1 and recursive call for other cases.

3

Write the iterative factorial method

Write a method called FactorialIterative that takes an integer n and returns the factorial using a for loop. Start with a variable result set to 1, then multiply it by each number from 1 to n.

DSA C#

int number = 5;

int FactorialRecursive(int n)
{
    if (n == 1)
        return 1;
    else
        return n * FactorialRecursive(n - 1);
}

// Write the iterative method FactorialIterative below

Hint

Use a for loop from 1 to n multiplying a result variable.

4

Print the results of both methods

Print the factorial of number using both FactorialRecursive(number) and FactorialIterative(number). Use Console.WriteLine to show the results with clear labels.

DSA C#

int number = 5;

int FactorialRecursive(int n)
{
    if (n == 1)
        return 1;
    else
        return n * FactorialRecursive(n - 1);
}

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

// Print the factorial results below

Hint

Use Console.WriteLine with string interpolation to print both results.

Practice

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

easy

A. When memory usage must be minimal

B. When you want to avoid function call overhead

C. When the problem can be divided into similar smaller problems

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 similar problems, like factorial or tree traversal.

2. Step 2: Compare with iteration needs

   Iteration is better for simple repeated loops or when avoiding function call overhead is important.

3. Final Answer:

   When the problem can be divided into similar smaller problems -> Option C

4. Quick Check:

   Recursion = divide and conquer [OK]

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

Common Mistakes:

• Thinking iteration is always better for all problems
• Ignoring function call overhead in recursion
• Confusing recursion with simple loops

2. Which of the following is the correct syntax for a recursive method in C#?

easy

A. void RecursiveMethod() { while(true) { RecursiveMethod(); } }

B. void RecursiveMethod() { if(condition) RecursiveMethod(); else return; }

C. void RecursiveMethod() { for(int i=0; i<10; i++) RecursiveMethod(); }

D. void RecursiveMethod() { RecursiveMethod(); }

Solution

1. Step 1: Identify base case in recursion

   Recursive methods must have a base case to stop calling themselves, shown by the else return in void RecursiveMethod() { if(condition) RecursiveMethod(); else return; }.

2. Step 2: Check other options for missing base case

   Options B, C, and D call themselves without stopping, causing infinite recursion.

3. Final Answer:

   void RecursiveMethod() { if(condition) RecursiveMethod(); else return; } -> Option B

4. Quick Check:

   Base case needed in recursion [OK]

Hint: Look for base case to stop recursion [OK]

Common Mistakes:

• Missing base case causing infinite recursion
• Using loops inside recursion incorrectly
• Confusing iteration syntax with recursion

3. What will be the output of the following C# code?

int Factorial(int n) {
  if (n == 0) return 1;
  return n * Factorial(n - 1);
}
Console.WriteLine(Factorial(4));

medium

A. Error: Stack overflow

B. 10

C. 16

D. 24

Solution

1. Step 1: Trace recursive calls for Factorial(4)

   Factorial(4) calls Factorial(3), then Factorial(2), Factorial(1), Factorial(0) which returns 1.

2. Step 2: Calculate return values step-by-step

   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)! [OK]

Common Mistakes:

• Confusing factorial with sum
• Forgetting base case returns 1
• Miscounting recursive calls

4. The following iterative method is intended to compute the sum of numbers from 1 to n. What is the bug?

int Sum(int n) {
  int total = 0;
  for (int i = 1; i <= n; i++) {
    total = i;
  }
  return total;
}

medium

A. The total variable is overwritten instead of accumulated

B. The loop condition should be i < n instead of i <= n

C. The loop should start from 0 instead of 1

D. The method should use recursion instead of iteration

Solution

1. Step 1: Analyze the loop body

   The line total = i; overwrites total each time instead of adding i to total.

2. Step 2: Identify correct accumulation

   It should be total += i; to accumulate the sum of numbers from 1 to n.

3. Final Answer:

   The total variable is overwritten instead of accumulated -> Option A

4. Quick Check:

   Use += to accumulate sums [OK]

Hint: Use += to add values, not = [OK]

Common Mistakes:

• Overwriting sum instead of adding
• Changing loop bounds unnecessarily
• Thinking recursion is required here

5. You need to process a large dataset with a depth-first search (DFS) on a tree structure. Which approach is better and why?

hard

A. Use iteration with a stack to avoid stack overflow on deep trees

B. Use recursion because it is simpler and uses less memory

C. Use recursion because iteration cannot handle tree traversal

D. Use iteration because recursion is always slower

Solution

1. Step 1: Understand DFS on deep trees

   DFS can be implemented with recursion or iteration using a stack. Deep trees risk stack overflow with recursion.

2. Step 2: Compare recursion and iteration for large depth

   Iteration with an explicit stack avoids call stack limits and prevents stack overflow errors.

3. Final Answer:

   Use iteration with a stack to avoid stack overflow on deep trees -> Option A

4. Quick Check:

   Iteration avoids recursion stack limits [OK]

Hint: Use iteration with stack for deep recursion [OK]

Common Mistakes:

• Assuming recursion always uses less memory
• Thinking iteration can't do DFS
• Ignoring stack overflow risk