DP vs Recursion vs Greedy Choosing the Right Tool in DSA Rust - Build Both Approaches

DP vs Recursion vs Greedy: Choosing the Right Tool

📖 Scenario: Imagine you are helping a small delivery company decide the best way to pack boxes with items to maximize value without exceeding weight limits. You will explore three ways to solve this problem: simple recursion, dynamic programming, and a greedy approach.

🎯 Goal: Build a Rust program that uses recursion, dynamic programming, and greedy methods to solve a simple knapsack problem. You will see how each method works and compare their results.

📋 What You'll Learn

Create a list of items with weights and values

Set a maximum weight capacity for the knapsack

Write a recursive function to find max value

Write a dynamic programming function to find max value

Write a greedy function to find max value

Print the results of all three methods

💡 Why This Matters

🌍 Real World

Packing items efficiently in delivery trucks or backpacks to maximize value without exceeding weight limits.

💼 Career

Understanding different algorithmic approaches helps in software engineering roles that require optimization and problem solving.

1

Create the list of items

Create a vector called items with these tuples representing (weight, value): (2, 3), (3, 4), (4, 5), (5, 8).

DSA Rust

// Your code here

Hint

Use let items = vec![(weight1, value1), (weight2, value2), ...];

2

Set the maximum weight capacity

Add a variable called max_weight and set it to 8.

DSA Rust

fn main() {
    let items = vec![(2, 3), (3, 4), (4, 5), (5, 8)];
    // Your code here
}

Hint

Use let max_weight = 8; to set the capacity.

3

Write the recursive function for max value

Write a recursive function called knapsack_recursive that takes items, max_weight, and index and returns the maximum value. Use recursion to decide whether to include or exclude the current item at index.

DSA Rust

fn main() {
    let items = vec![(2, 3), (3, 4), (4, 5), (5, 8)];
    let max_weight = 8;

    // Your code here
}

Hint

Use base case when index == items.len() or max_weight == 0. Then decide to include or exclude current item.

4

Print the max values from all methods

Call knapsack_recursive with items, max_weight, and 0 and print the result with println!("Recursive max value: {}", result).

DSA Rust

fn knapsack_recursive(items: &Vec, max_weight: i32, index: usize) -> i32 {
    if index == items.len() || max_weight == 0 {
        return 0;
    }
    let (weight, value) = items[index];
    if weight > max_weight {
        return knapsack_recursive(items, max_weight, index + 1);
    } else {
        let include = value + knapsack_recursive(items, max_weight - weight, index + 1);
        let exclude = knapsack_recursive(items, max_weight, index + 1);
        return if include > exclude { include } else { exclude };
    }
}

fn main() {
    let items = vec![(2, 3), (3, 4), (4, 5), (5, 8)];
    let max_weight = 8;

    // Your code here
}

Hint

Call knapsack_recursive(&items, max_weight, 0) and print the result.

Practice

1. Which approach is best suited when a problem has overlapping subproblems and optimal substructure?

easy

A. Dynamic Programming

B. Greedy Algorithm

C. Simple Recursion without memoization

D. Brute Force

Solution

1. Step 1: Understand problem characteristics

   Overlapping subproblems means the same smaller problems repeat. Optimal substructure means the best solution can be built from best solutions of smaller problems.

2. Step 2: Match approach to characteristics

   Dynamic Programming stores results of subproblems to avoid recomputation and uses optimal substructure to build the solution efficiently.

3. Final Answer:

   Dynamic Programming -> Option A

4. Quick Check:

   Overlapping subproblems + optimal substructure = Dynamic Programming [OK]

Hint: Use DP when subproblems repeat and build optimal solutions [OK]

Common Mistakes:

• Choosing greedy when subproblems overlap
• Using simple recursion without memoization causing slow code
• Confusing optimal substructure with greedy choice property

2. Which of the following Rust function signatures correctly represents a recursive function that returns an integer?

easy

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

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

C. fn factorial(n: u32) -> String { if n == 0 { "1".to_string() } else { (n * factorial(n - 1)).to_string() } }

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

Solution

1. Step 1: Check function return type and recursion

   fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } } returns u32 and calls itself recursively correctly. fn factorial(n: u32) { if n == 0 { 1 } else { n * factorial(n - 1) } } lacks return type, so it returns unit ().

2. Step 2: Validate correctness of recursion and return

   fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } } correctly returns the factorial value recursively. fn factorial(n: u32) -> u32 { let mut result = 1; for i in 1..=n { result *= i; } result } is iterative, not recursive. fn factorial(n: u32) -> String { if n == 0 { "1".to_string() } else { (n * factorial(n - 1)).to_string() } } returns String, not integer.

3. Final Answer:

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

4. Quick Check:

   Recursive function with correct return type = fn factorial(n: u32) -> u32 { if n == 0 { 1 } else { n * factorial(n - 1) } } [OK]

Hint: Recursive functions must specify return type matching recursive calls [OK]

Common Mistakes:

• Omitting return type causes compilation errors
• Confusing iterative and recursive implementations
• Returning wrong data types in recursion

3. What is the output of the following Rust code using recursion to compute Fibonacci numbers?

fn fib(n: u32) -> u32 {
    if n <= 1 {
        n
    } else {
        fib(n - 1) + fib(n - 2)
    }
}

fn main() {
    println!("{}", fib(5));
}

medium

A. 13

B. 5

C. 3

D. 8

Solution

1. Step 1: Understand Fibonacci recursion

   fib(5) = fib(4) + fib(3). Calculate fib(4) and fib(3) similarly until base cases fib(1)=1 and fib(0)=0.

2. Step 2: Calculate fib(5) step-by-step

   fib(0)=0, fib(1)=1, fib(2)=1, fib(3)=2, fib(4)=3, fib(5)=5.

3. Final Answer:

   5 -> Option B

4. Quick Check:

   Fibonacci of 5 = 5 [OK]

Hint: Trace base cases and add results up to n [OK]

Common Mistakes:

• Confusing fib(5) with fib(6)
• Miscounting base cases
• Assuming fib(0) = 1 instead of 0

4. The following Rust code attempts to implement a greedy algorithm for coin change but has a bug. What is the bug?

fn coin_change(coins: &[u32], amount: u32) -> u32 {
    let mut remaining = amount;
    let mut count = 0;
    for &coin in coins {
        count += remaining / coin;
        remaining %= coin;
    }
    if remaining == 0 { count } else { 0 }
}

fn main() {
    let coins = [1, 2, 5];
    println!("{}", coin_change(&coins, 11));
}

medium

A. The loop should break when remaining is zero

B. The function returns 0 instead of -1 when change is impossible

C. Coins are not sorted in descending order, so greedy fails

D. The function uses integer division which causes errors

Solution

1. Step 1: Check coin order

   Greedy coin change requires coins sorted in descending order to pick largest first. Here coins=[1, 2, 5] are ascending, so it picks smallest first.

2. Step 2: Trace execution

   For amount=11: coin=1, count=11, remaining=0; subsequent coins add 0. Returns 11, but optimal is 3 (5+5+1). Greedy suboptimal.

3. Final Answer:

   Coins are not sorted in descending order, so greedy fails -> Option C

4. Quick Check:

   Greedy needs descending coin order [OK]

Hint: Always sort coins descending for greedy coin change [OK]

Common Mistakes:

• Assuming greedy always works for any coin set
• Ignoring coin order importance
• Confusing return values for impossible change

5. You want to find the minimum number of coins needed to make a certain amount using coins of denominations [1, 3, 4]. Which approach is best and why?

hard

A. Use dynamic programming to store minimum coins needed for smaller amounts and build up

B. Use recursion without memoization to explore all combinations

C. Use a greedy algorithm because picking the largest coin first always gives minimum coins

D. Use simple iteration over coins without storing intermediate results

Solution

1. Step 1: Analyze greedy suitability

   Greedy fails here because picking largest coin first (4) may not lead to minimum coins for all amounts (e.g., amount=6).

2. Step 2: Consider recursion and DP

   Recursion without memoization repeats calculations and is inefficient. Dynamic programming stores results for smaller amounts, avoiding recomputation and ensuring minimum coins.

3. Final Answer:

   Use dynamic programming to store minimum coins needed for smaller amounts and build up -> Option A

4. Quick Check:

   Minimum coins with overlapping subproblems = Dynamic Programming [OK]

Hint: DP stores sub-results to find minimum coins efficiently [OK]

Common Mistakes:

• Assuming greedy always works for coin change
• Using recursion without memoization causing slow code
• Ignoring overlapping subproblems in coin change