Why Recursion Exists and What Loops Cannot Express Cleanly in DSA Java - Test Your Knowledge

Practice - 5 Tasks

1fill in blank

easy

Complete the code to make the factorial function recursive.

DSA Java

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

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

A0

Bn - 1

Cn + 1

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 causes infinite recursion.

Returning 1 always ignores the recursive step.

The factorial of n is n times factorial of n-1, so we call factorial(n - 1).

2fill in blank

medium

Complete the code to calculate the nth Fibonacci number recursively.

DSA Java

public 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'

A1

Bn - 2

Cn + 1

Dn - 1

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 causes infinite recursion.

Using the same argument twice misses the sequence logic.

Fibonacci of n is sum of fibonacci(n-1) and fibonacci(n-2).

3fill in blank

hard

Fix the error in the recursive sum function to correctly sum numbers from 1 to n.

DSA Java

public int sum(int n) {
    if (n == 0) {
        return 0;
    } else {
        return n + sum([1]);
    }
}

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

An + 1

B0

Cn - 1

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Using n + 1 causes infinite recursion.

Returning 0 always ignores the recursive step.

To sum from 1 to n, we add n plus sum of numbers up to n-1.

4fill in blank

hard

Fill both blanks to create a recursive function that reverses a string.

DSA Java

public String reverse(String s) {
    if (s.isEmpty()) {
        return s;
    } else {
        return reverse(s[1]) + s.charAt([2]);
    }
}

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

Asubstring(1)

Blength() - 1

Csubstring(0, s.length() - 1)

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Using substring(0, s.length() - 1) reverses the wrong part.

Using length() - 1 as index causes index errors.

We reverse the substring from index 1 onward and add the first character at the end.

5fill in blank

hard

Fill both blanks to implement a recursive function that counts occurrences of a character in a string.

DSA Java

public int countChar(String s, char c) {
    if (s.isEmpty()) {
        return 0;
    } else {
        int count = (s.charAt([1]) == c) ? 1 : 0;
        return count + countChar(s[2], c);
    }
}

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

A0

Bsubstring(1)

Dsubstring(0, s.length() - 1)

Attempts:

3 left

💡 Hint

Common Mistakes

Using substring(0, s.length() - 1) removes the last character instead of the first.

Changing c in recursive calls causes errors.

Check the first character at index 0, then recurse on substring from index 1, passing c unchanged.

Practice

1. Why do we use recursion instead of loops in some problems?

easy

A. Because loops are slower than recursion in all cases

B. Because loops cannot repeat tasks

C. Because recursion uses less memory than loops always

D. Because recursion can express problems with self-similar subproblems more naturally

Solution

1. Step 1: Understand problem structure

   Some problems break down into smaller versions of themselves, like tree traversals or factorial calculation.

2. Step 2: Compare recursion and loops

   Loops repeat tasks but do not naturally express self-similar subproblems, while recursion calls itself to handle smaller parts.

3. Final Answer:

   Because recursion can express problems with self-similar subproblems more naturally -> Option D

4. Quick Check:

   Recursion fits self-similar problems = B [OK]

Hint: Recursion fits self-similar problems better than loops [OK]

Common Mistakes:

• Thinking loops are always faster than recursion
• Believing recursion always uses less memory
• Assuming loops cannot repeat tasks

2. Which of the following is the correct syntax to define a recursive method in Java?

easy

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

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

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

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

Solution

1. Step 1: Identify base condition in recursion

   Recursive methods must have a condition to stop calling themselves to avoid infinite recursion.

2. Step 2: Check options for base condition

   void recurse() { if(condition) recurse(); } uses an if(condition) to control recursion, which is correct. Others either lack a base case or use loops incorrectly.

3. Final Answer:

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

4. Quick Check:

   Recursion needs base condition = A [OK]

Hint: Look for base condition controlling recursion call [OK]

Common Mistakes:

• Missing base condition causing infinite recursion
• Using loops inside recursion incorrectly
• Confusing recursion call with loop iteration

3. What is the output of the following Java code?

public class Test {
  static int factorial(int n) {
    if (n == 0) return 1;
    else return n * factorial(n - 1);
  }
  public static void main(String[] args) {
    System.out.println(factorial(4));
  }
}

medium

A. 24

B. 10

C. 120

D. Error: StackOverflow

Solution

1. Step 1: Trace factorial calls

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

2. Step 2: Calculate return values

   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 A

4. Quick Check:

   4! = 24 [OK]

Hint: Recall factorial n! = n*(n-1)! [OK]

Common Mistakes:

• Confusing factorial(4) with factorial(5)
• Forgetting base case returns 1
• Assuming infinite recursion causes error here

4. Identify the error in this recursive Java method that calculates the sum of numbers from 1 to n:

int sum(int n) {
  if (n == 1) return 1;
  else return n + sum(n);
}

medium

A. Recursive call uses sum(n) instead of sum(n - 1), causing infinite recursion

B. Method should return void instead of int

C. Missing base case for n == 0

D. No error, code works fine

Solution

1. Step 1: Analyze recursive call

   The method calls sum(n) again without reducing n, so it never reaches base case and recurses infinitely.

2. Step 2: Identify fix

   Recursive call should be sum(n - 1) to reduce n and eventually reach base case.

3. Final Answer:

   Recursive call uses sum(n) instead of sum(n - 1), causing infinite recursion -> Option A

4. Quick Check:

   Recursive call must reduce n = C [OK]

Hint: Check if recursive call moves toward base case [OK]

Common Mistakes:

• Ignoring infinite recursion risk
• Thinking base case is missing
• Confusing return type with recursion logic

5. You want to print all subsets of a set {1, 2, 3} using recursion. Why is recursion better suited than loops for this task?

hard

A. Because loops cannot iterate over numbers

B. Because subsets require exploring all combinations, which is naturally expressed by recursive branching

C. Because recursion uses less memory than loops for subsets

D. Because loops cannot print output

Solution

1. Step 1: Understand subsets generation

   Generating subsets involves choosing to include or exclude each element, creating a branching tree of possibilities.

2. Step 2: Compare recursion and loops

   Recursion naturally explores each branch by calling itself with different choices, while loops struggle to express this branching cleanly.

3. Final Answer:

   Because subsets require exploring all combinations, which is naturally expressed by recursive branching -> Option B

4. Quick Check:

   Recursive branching fits subsets = A [OK]

Hint: Subsets need branching; recursion models branching naturally [OK]

Common Mistakes:

• Thinking loops cannot iterate numbers
• Assuming recursion always uses less memory
• Believing loops cannot print