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

Practice - 5 Tasks

1fill in blank

easy

Complete the code to calculate factorial using recursion.

DSA Java

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

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

A1

Bn + 1

Cn - 1

Dn

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 causes infinite recursion.

Using n or 1 does not reduce the problem size.

The recursive call must reduce the problem size by 1 each time, so n - 1 is correct.

2fill in blank

medium

Complete the code to calculate factorial using iteration.

DSA Java

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

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

An - 1

Bn

Ci

Dresult

Attempts:

3 left

💡 Hint

Common Mistakes

Using n - 1 excludes the last multiplication.

Using i or result in the condition is incorrect.

The loop should run from 1 to n inclusive, so the condition is i <= n.

3fill in blank

hard

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

DSA Java

int fibonacci(int n) {
    if (n <= 1) {
        return n;
    } else {
        return fibonacci([1]) + fibonacci(n - 2);
    }
}

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

An - 1

Bn + 1

C1

Dn

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 causes infinite recursion.

Using n or 1 does not correctly reduce the problem size.

The recursive calls must reduce the problem size. Using n - 1 and n - 2 correctly moves towards the base case.

4fill in blank

hard

Fill both blanks to complete the iterative Fibonacci function.

DSA Java

int fibonacci(int n) {
    if (n <= 1) return n;
    int a = 0, b = 1, c;
    for (int i = 2; i <= [1]; i++) {
        c = a + b;
        a = [2];
        b = c;
    }
    return b;
}

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

An

Bb

Ca

Dc

Attempts:

3 left

💡 Hint

Common Mistakes

Using wrong loop limit causes incorrect results.

Assigning a = a or a = c breaks the Fibonacci sequence.

The loop runs until i <= n, and a should be updated to the old b value.

5fill in blank

hard

Fill all three blanks to create a recursive function that sums elements of an array.

DSA Java

int sumArray(int[] arr, int index) {
    if (index == [1]) {
        return 0;
    }
    return arr[[2]] + sumArray(arr, [3]);
}

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

Aarr.length

Bindex

Cindex + 1

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Using 0 as base case index causes infinite recursion.

Not incrementing index in recursive call causes infinite loop.

The base case is when index reaches the array length. We add the current element at index and recurse with index + 1.

Practice

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

easy

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

B. When you want to avoid function call overhead

C. When memory usage must be minimal

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 tree traversals or factorial calculation.

2. Step 2: Compare with iteration scenarios

   Iteration is better for simple repeated loops or when minimizing overhead and memory is critical.

3. Final Answer:

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

4. Quick Check:

   Recursion fits divide-and-conquer problems = A [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 to write a recursive method in Java?

easy

A. public void recurse() { recurse(); }

B. public void recurse() { while(true) recurse(); }

C. public void recurse() { if(condition) recurse(); }

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

Solution

1. Step 1: Identify valid recursive call

   A recursive method must have a base condition to stop calling itself, so it uses if(condition) before recursion.

2. Step 2: Check options for base condition

   public void recurse() { if(condition) recurse(); } uses if(condition) recurse(); which is correct. Others cause infinite recursion or misuse loops.

3. Final Answer:

   public void recurse() { if(condition) recurse(); } -> Option C

4. Quick Check:

   Base condition needed for recursion = D [OK]

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

Common Mistakes:

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

3. What will be the output of the following Java code?

public class Test {
  static int count = 0;
  public static void recurse(int n) {
    if (n == 0) return;
    count++;
    recurse(n - 1);
  }
  public static void main(String[] args) {
    recurse(3);
    System.out.println(count);
  }
}

medium

A. 4

B. 3

C. 0

D. StackOverflowError

Solution

1. Step 1: Trace recursive calls

   recurse(3) calls recurse(2), then recurse(1), then recurse(0) which returns without incrementing count.

2. Step 2: Count increments

   count increments at n=3, 2, 1, so total increments = 3.

3. Final Answer:

   3 -> Option B

4. Quick Check:

   Count increments per call except base = 3 [OK]

Hint: Count increments before recursive call, base stops at zero [OK]

Common Mistakes:

• Counting base case call as increment
• Expecting stack overflow due to small input
• Miscounting recursive calls

4. Identify the error in this iterative factorial method and fix it:

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

// Called with factorial(-3)

medium

A. Missing return statement

B. Infinite loop due to wrong loop condition

C. No error, returns 1 for negative input

D. Should check for negative input to avoid incorrect result

Solution

1. Step 1: Analyze loop behavior with negative input

   For n = -3, loop condition i <= n is false at start (1 <= -3), so loop never runs and returns 1 incorrectly.

2. Step 2: Add input validation

   Factorial is undefined for negative numbers, so method should check and handle negative input before loop.

3. Final Answer:

   Should check for negative input to avoid incorrect result -> Option D

4. Quick Check:

   Validate input before iteration = A [OK]

Hint: Always validate inputs before loops in iterative methods [OK]

Common Mistakes:

• Ignoring negative inputs in factorial
• Assuming loop runs for negative n
• Missing input validation

5. You need to process a large dataset with unknown depth of nested structures. Which approach is better and why?

Options:
A) Use recursion for simplicity but risk stack overflow.
B) Use iteration with explicit stack to handle unknown depth safely.
C) Use recursion with no base case to ensure all data is processed.
D) Use iteration with fixed loop count assuming max depth known.

hard

A. Use iteration with explicit stack to handle unknown depth safely.

B. Use recursion for simplicity but risk stack overflow.

C. Use recursion with no base case to ensure all data is processed.

D. Use iteration with fixed loop count assuming max depth known.

Solution

1. Step 1: Understand problem constraints

   Unknown depth means recursion might cause stack overflow if too deep.

2. Step 2: Compare recursion and iteration

   Iteration with an explicit stack simulates recursion safely and avoids overflow.

3. Step 3: Evaluate incorrect options

   Use recursion with no base case to ensure all data is processed. is wrong due to no base case causing infinite recursion. Use iteration with fixed loop count assuming max depth known. assumes fixed depth which is unsafe.

4. Final Answer:

   Use iteration with explicit stack to handle unknown depth safely. -> Option A

5. Quick Check:

   Iteration + explicit stack avoids recursion limits = B [OK]

Hint: Use explicit stack iteration for unknown or deep recursion [OK]

Common Mistakes:

• Ignoring stack overflow risk in recursion
• Assuming fixed depth for iteration
• Missing base case in recursion