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

Recursion vs Iteration: When Each Wins

📖 Scenario: Imagine you are helping a friend understand when to use recursion or iteration in programming. You will create simple Java code examples to see how both methods work for calculating the factorial of a number. This will help your friend decide which method to use in different situations.

🎯 Goal: Build two Java methods to calculate the factorial of a number: one using recursion and one using iteration. Then, print the results to compare both approaches.

📋 What You'll Learn

Create a variable number with the value 5

Create a recursive method factorialRecursive that takes an int n and returns the factorial of n

Create an iterative method factorialIterative that takes an int n and returns the factorial of n

Print the factorial of number using both methods

💡 Why This Matters

🌍 Real World

Calculating factorial is a common example to understand recursion and iteration, which are used in many algorithms like searching, sorting, and tree traversals.

💼 Career

Understanding recursion and iteration helps in writing efficient code and solving complex problems in software development.

1

Create the number variable

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

DSA Java

// Your code here

Hint

Use int number = 5; inside the main method.

2

Add the recursive factorial method

Add a recursive method called factorialRecursive that takes an integer n and returns the factorial of n. Use the base case when n is 0 or 1, return 1. Otherwise, return n * factorialRecursive(n - 1).

DSA Java

public class FactorialComparison {
    public static void main(String[] args) {
        int number = 5;
    }

    // Your code here
}

Hint

Remember the base case returns 1 for 0 or 1, and the recursive call multiplies n by the factorial of n - 1.

3

Add the iterative factorial method

Add an iterative method called factorialIterative that takes an integer n and returns the factorial of n. Use a for loop to multiply numbers from 1 to n.

DSA Java

public class FactorialComparison {
    public static void main(String[] args) {
        int number = 5;
    }

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

    // Your code here
}

Hint

Use a for loop from 1 to n and multiply a result variable each time.

4

Print factorial results using both methods

Inside the main method, print the factorial of number using both factorialRecursive(number) and factorialIterative(number). Use System.out.println to display the results with clear labels.

DSA Java

public class FactorialComparison {
    public static void main(String[] args) {
        int number = 5;
        // Your code here
    }

    public static int factorialRecursive(int n) {
        if (n == 0 || n == 1) {
            return 1;
        } else {
            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;
    }
}

Hint

Use System.out.println twice to print both factorial results with labels.

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