Recursion vs Iteration When Each Wins in DSA Java - Compare & Choose

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Recursive vs Iterative Factorial

What is the output of the following Java code that calculates factorial using recursion and iteration?

DSA Java

public class FactorialTest {
    public static int factorialRecursive(int n) {
        if (n == 0) return 1;
        return n * factorialRecursive(n - 1);
    }

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

    public static void main(String[] args) {
        System.out.println(factorialRecursive(5));
        System.out.println(factorialIterative(5));
    }
}

A 120\n120

B 120\n24

C 24\n120

D 24\n24

💡 Hint

Recall factorial of 5 is 5*4*3*2*1.

Both recursive and iterative methods correctly compute factorial of 5 as 120.

🧠 Conceptual

intermediate

When is recursion preferred over iteration?

Which scenario best explains when recursion is preferred over iteration?

A When the problem involves only linear loops without nested calls.

B When the problem requires simple repeated addition or multiplication.

C When the problem can be naturally divided into similar subproblems, like tree traversals.

D When memory usage must be minimized and stack overflow avoided.

💡 Hint

Think about problems like exploring branches or nested structures.

Recursion is ideal for problems that break down into smaller similar problems, such as traversing trees or graphs.

❓ Predict Output

advanced

Stack Overflow in Deep Recursion

What error does the following Java code produce when run with input n=100000?

DSA Java

public class DeepRecursion {
    public static int sum(int n) {
        if (n == 0) return 0;
        return n + sum(n - 1);
    }

    public static void main(String[] args) {
        System.out.println(sum(100000));
    }
}

A 0

B java.lang.StackOverflowError

C 100000 * 100001 / 2 = 5000050000

D java.lang.OutOfMemoryError

💡 Hint

Think about how many recursive calls happen and Java's stack size.

Java has limited stack size; deep recursion like 100000 calls causes StackOverflowError.

🧠 Conceptual

advanced

Why iteration can be better for large input sizes?

Why is iteration often preferred over recursion for very large input sizes?

A Iteration uses constant stack space, avoiding stack overflow errors.

B Iteration always runs faster than recursion in all cases.

C Iteration uses more memory than recursion, which is better for large inputs.

D Iteration cannot handle nested or hierarchical data structures.

💡 Hint

Consider memory usage and call stack limits.

Iteration uses loops and does not add to the call stack, so it avoids stack overflow and uses less memory for large inputs.

🔧 Debug

expert

Identify the output of mutual recursion

What is the output of this Java code using mutual recursion?

DSA Java

public class MutualRecursion {
    public static void even(int n) {
        if (n == 0) {
            System.out.print("Even");
        } else {
            odd(n - 1);
        }
    }

    public static void odd(int n) {
        if (n == 0) {
            System.out.print("Odd");
        } else {
            even(n - 1);
        }
    }

    public static void main(String[] args) {
        even(3);
    }
}

A Even

B EvenOdd

C OddEven

D Odd

💡 Hint

Trace the calls: even(3) calls odd(2), odd(2) calls even(1), etc.

The calls alternate until n reaches 0 in odd(), which prints "Odd".

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