Recursion vs Iteration When Each Wins in DSA C# - Interactive Comparison Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to calculate factorial using recursion.

DSA C#

int Factorial(int n) {
    if (n == 0) return 1;
    return n * Factorial(n [1] 1);
}

Drag options to blanks, or click blank then click option'

A+

B/

C*

D-

Attempts:

3 left

💡 Hint

Common Mistakes

Using addition instead of subtraction causes infinite recursion.

Using multiplication or division in the recursive call parameter is incorrect.

The factorial of n is n multiplied by factorial of (n-1). So we subtract 1.

2fill in blank

medium

Complete the code to iterate through an array and sum its elements.

DSA C#

int SumArray(int[] arr) {
    int sum = 0;
    for (int i = 0; i [1] arr.Length; i++) {
        sum += arr[i];
    }
    return sum;
}

Drag options to blanks, or click blank then click option'

A<

B<=

C>

D>=

Attempts:

3 left

💡 Hint

Common Mistakes

Using <= causes index out of range error.

Using > or >= will not enter the loop.

The loop should run while i is less than the array length to avoid out-of-bounds error.

3fill in blank

hard

Fix the error in the recursive Fibonacci function to avoid infinite recursion.

DSA C#

int Fibonacci(int n) {
    if (n == 0) return 0;
    if (n == 1) return 1;
    return Fibonacci(n [1] 1) + Fibonacci(n [1] 2);
}

Drag options to blanks, or click blank then click option'

A*

B+

C-

D/

Attempts:

3 left

💡 Hint

Common Mistakes

Using addition in recursive calls causes infinite recursion.

Using multiplication or division is incorrect.

To get previous Fibonacci numbers, subtract 1 and 2 from n in recursive calls.

4fill in blank

hard

Fill both blanks to create a recursive function that sums numbers from 1 to n.

DSA C#

int SumToN(int n) {
    if (n == 0) return 0;
    return n [1] SumToN(n [2] 1);
}

Drag options to blanks, or click blank then click option'

A+

B-

C*

D/

Attempts:

3 left

💡 Hint

Common Mistakes

Using multiplication or division instead of addition.

Using addition instead of subtraction in recursive call.

The function adds n to the sum of numbers up to n-1, so use + and - operators.

5fill in blank

hard

Fill all three blanks to create a dictionary comprehension that maps numbers to their factorials for 1 to 5.

DSA C#

var factorials = new Dictionary<int, int>() {
    { [1], [2] }
};

int Factorial(int n) {
    if (n == 0) return 1;
    return n * Factorial(n [3] 1);
}

Drag options to blanks, or click blank then click option'

A1

BFactorial(1)

C-

D5

Attempts:

3 left

💡 Hint

Common Mistakes

Using addition instead of subtraction in factorial function.

Using incorrect keys or values in dictionary.

The dictionary starts with key 1 and value Factorial(1). The factorial function subtracts 1 recursively.

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