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

Recursion vs Iteration: When Each Wins

📖 Scenario: Imagine you are helping a friend understand two ways to solve problems: recursion and iteration. You will create simple Rust code to see how each method works for counting down numbers. This will help your friend know when to use recursion and when to use iteration.

🎯 Goal: Build two functions in Rust: one using recursion and one using iteration to count down from a number to zero. Then, print the results to compare both methods.

📋 What You'll Learn

Create a variable start with the value 5

Create a recursive function countdown_recursive that takes an integer and prints numbers down to zero

Create an iterative function countdown_iterative that takes an integer and prints numbers down to zero

Call both functions with start and print their outputs

💡 Why This Matters

🌍 Real World

Counting down or processing sequences is common in games, timers, and algorithms. Knowing recursion and iteration helps solve many problems.

💼 Career

Understanding recursion and iteration is essential for coding interviews, algorithm design, and writing efficient code in software development.

1

Create the starting number

Create a variable called start and set it to 5

DSA Rust

# Create a variable called start and set it to 5
# Your code here

Hint

Use let start = 5; inside the main function.

2

Write the recursive countdown function

Add a recursive function called countdown_recursive that takes an i32 parameter called n. It should print n and call itself with n - 1 until n is less than 0.

DSA Rust

fn main() {
    let start = 5;
}

// Write the recursive function countdown_recursive here
// Your code here

Hint

Use a base case to stop recursion when n < 0. Print n before calling the function again with n - 1.

3

Write the iterative countdown function

Add an iterative function called countdown_iterative that takes an i32 parameter called n. Use a for loop to print numbers from n down to 0.

DSA Rust

fn main() {
    let start = 5;
}

fn countdown_recursive(n: i32) {
    if n < 0 {
        return;
    }
    println!("{}", n);
    countdown_recursive(n - 1);
}

// Write the iterative function countdown_iterative here
// Your code here

Hint

Use a for loop with (0..=n).rev() to count down from n to 0.

4

Call both functions and print outputs

Inside main, call countdown_recursive(start) and then countdown_iterative(start) to print the countdowns.

DSA Rust

fn main() {
    let start = 5;
    // Call countdown_recursive and countdown_iterative here
    // Your code here
}

fn countdown_recursive(n: i32) {
    if n < 0 {
        return;
    }
    println!("{}", n);
    countdown_recursive(n - 1);
}

fn countdown_iterative(n: i32) {
    for i in (0..=n).rev() {
        println!("{}", i);
    }
}

Hint

Call countdown_recursive(start); and then countdown_iterative(start); inside main.

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