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

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Recursive vs Iterative Factorial

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

DSA Rust

fn factorial_recursive(n: u32) -> u32 {
    if n == 0 { 1 } else { n * factorial_recursive(n - 1) }
}

fn factorial_iterative(n: u32) -> u32 {
    let mut result = 1;
    for i in 1..=n {
        result *= i;
    }
    result
}

fn main() {
    let rec = factorial_recursive(5);
    let iter = factorial_iterative(5);
    println!("Recursive: {} Iterative: {}", rec, iter);
}

A Recursive: 24 Iterative: 120

B Recursive: 120 Iterative: 120

C Recursive: 120 Iterative: 24

D Recursive: 0 Iterative: 0

💡 Hint

Recall factorial of 5 is 5*4*3*2*1 = 120

Both recursive and iterative functions 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 language does not support function calls

B When performance and memory usage must be minimal

C When the problem naturally fits a divide-and-conquer approach like tree traversal

D When the problem requires simple repeated loops without nested calls

💡 Hint

Think about problems like exploring branches of a tree.

Recursion is ideal for problems like tree traversal where the problem breaks down into similar subproblems.

❓ Predict Output

advanced

Stack Overflow Risk in Recursion

What error or output will this Rust code produce when called with n = 100000?

DSA Rust

fn recursive_sum(n: u32) -> u32 {
    if n == 0 { 0 } else { n + recursive_sum(n - 1) }
}

fn main() {
    let result = recursive_sum(100000);
    println!("Sum: {}", result);
}

A Stack overflow error at runtime

B Sum: 5000050000

C Compilation error due to recursion

D Sum: 0

💡 Hint

Consider how deep the recursion goes and Rust's stack limits.

Rust does not optimize tail recursion, so deep recursion causes stack overflow.

🧠 Conceptual

advanced

Iteration Advantage in Large Data Processing

Why is iteration often better than recursion for processing large data sets in Rust?

A Iteration requires more memory than recursion

B Iteration is always faster than recursion

C Iteration cannot handle nested data structures

D Iteration uses constant stack space, avoiding stack overflow

💡 Hint

Think about memory usage and stack size.

Iteration uses loops and constant stack space, so it handles large data without crashing.

🚀 Application

expert

Choosing Recursion or Iteration for Fibonacci

Given the task to compute the 40th Fibonacci number efficiently in Rust, which approach is best and why?

A Use iteration with a loop to avoid exponential time and stack overflow

B Use simple recursion without memoization for clarity

C Use recursion with no optimization to keep code short

D Use recursion with deep call stack to leverage Rust's tail call optimization

💡 Hint

Consider time complexity and stack limits for large Fibonacci numbers.

Simple recursion is exponential and slow; iteration is efficient and safe for large inputs.

Practice

1. Which situation is recursion generally better suited for compared to iteration?

easy

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

B. When you need to process large data sets with minimal memory

C. When you want to avoid function call overhead

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 use case

   Iteration is better for simple repeated loops or when memory overhead of function calls is a concern.

3. Final Answer:

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

4. Quick Check:

   Recursion fits divide-and-conquer problems [OK]

Hint: Recursion fits divide-and-conquer problems best [OK]

Common Mistakes:

• Thinking recursion is always faster
• Confusing iteration with recursion use cases
• Ignoring function call overhead in recursion

2. Which of the following is the correct Rust syntax to write a recursive function that calculates factorial?

easy

A. fn factorial(n: u32) -> u32 { loop { return n * factorial(n - 1); } }

B. fn factorial(n: u32) -> u32 { let mut result = 1; for i in 1..=n { result *= i; } result }

C. fn factorial(n: u32) -> u32 { while n > 0 { n *= n - 1; } n }

D. fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } }

Solution

1. Step 1: Identify recursive function structure

   Recursive factorial calls itself with n-1 until base case n==0 returns 1.

2. Step 2: Check each option's correctness

   fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } } correctly implements recursion with base case and recursive call. fn factorial(n: u32) -> u32 { let mut result = 1; for i in 1..=n { result *= i; } result } is iterative, C has incorrect loop logic, D causes infinite loop.

3. Final Answer:

   fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } } -> Option D

4. Quick Check:

   Recursive factorial syntax [OK]

Hint: Look for base case and recursive call in function [OK]

Common Mistakes:

• Missing base case causing infinite recursion
• Using loops instead of recursion for this question
• Incorrect loop or return statements

3. What is the output of this Rust code snippet?

fn sum_iter(n: u32) -> u32 {
    let mut total = 0;
    for i in 1..=n {
        total += i;
    }
    total
}

fn sum_rec(n: u32) -> u32 {
    if n == 0 {
        0
    } else {
        n + sum_rec(n - 1)
    }
}

fn main() {
    println!("{}", sum_iter(3));
    println!("{}", sum_rec(3));
}

medium

A. 6
6

B. 3
3

C. 0
0

D. Error due to stack overflow

Solution

1. Step 1: Trace sum_iter(3)

   Loop adds 1 + 2 + 3 = 6.

2. Step 2: Trace sum_rec(3)

   Recursively adds 3 + 2 + 1 + 0 = 6.

3. Final Answer:

   6 6 -> Option A

4. Quick Check:

   Both sum functions return 6 for input 3 [OK]

Hint: Sum 1 to n = n*(n+1)/2 = 6 for n=3 [OK]

Common Mistakes:

• Confusing output format with separate lines
• Assuming recursion causes error for small n
• Misreading loop range

4. Identify the bug in this recursive Rust function and choose the fix:

fn countdown(n: u32) {
    println!("{}", n);
    countdown(n - 1);
}

medium

A. Change println! to return n instead

B. Replace recursion with a for loop

C. Add a base case to stop recursion when n == 0

D. Use n + 1 instead of n - 1 in recursive call

Solution

1. Step 1: Analyze the recursive function

   Function calls itself with n-1 without stopping condition, causing infinite recursion.

2. Step 2: Determine fix to prevent infinite recursion

   Adding a base case like if n == 0 { return; } stops recursion safely.

3. Final Answer:

   Add a base case to stop recursion when n == 0 -> Option C

4. Quick Check:

   Base case prevents infinite recursion [OK]

Hint: Always add base case to recursive functions [OK]

Common Mistakes:

• Forgetting base case causes stack overflow
• Changing print statement instead of fixing recursion
• Using wrong recursive call direction

5. You want to process a large list of numbers to find the maximum value. Which approach is better in Rust and why? A recursive function that compares head and tail elements or an iterative loop?

hard

A. Recursive function, because Rust optimizes all recursion automatically

B. Iterative loop, because recursion may cause stack overflow on large lists

C. Recursive function, because it is always faster than iteration

D. Either approach is equally good for large lists

Solution

1. Step 1: Consider recursion limits in Rust

   Rust does not guarantee tail call optimization, so deep recursion risks stack overflow on large inputs.

2. Step 2: Compare iteration benefits

   Iteration uses constant stack space and is safer for large lists, avoiding overflow.

3. Final Answer:

   Iterative loop, because recursion may cause stack overflow on large lists -> Option B

4. Quick Check:

   Iteration safer for large data [OK]

Hint: Use iteration for large data to avoid stack overflow [OK]

Common Mistakes:

• Assuming recursion is always faster
• Ignoring stack overflow risk
• Believing Rust always optimizes recursion