Greedy vs DP How to Know Which to Apply in DSA C - Complexity Comparison

Time Complexity: Greedy vs DP How to Know Which to Apply

O(n)

Understanding Time Complexity

Choosing between Greedy and Dynamic Programming affects how fast your solution runs.

We want to know how the time needed grows as the problem size grows.

Scenario Under Consideration

Analyze the time complexity of these two approaches solving the same problem.

// Greedy approach example
int greedySolution(int arr[], int n) {
    int result = 0;
    for (int i = 0; i < n; i++) {
        if (canTake(arr[i])) {
            result += arr[i];
        }
    }
    return result;
}

// Dynamic Programming example
int dpSolution(int arr[], int n) {
    int dp[n+1];
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        dp[i] = max(dp[i-1], (i >= 2 ? dp[i-2] : 0) + arr[i-1]);
    }
    return dp[n];
}
    

The first tries a simple choice each step; the second builds answers using past results.

Identify Repeating Operations

Look at loops and repeated calculations.

• Primary operation: Both use a single loop over the input array.
• How many times: Each loop runs exactly n times, where n is input size.

How Execution Grows With Input

Both approaches do work proportional to the input size.

Input Size (n)	Approx. Operations
10	About 10 steps
100	About 100 steps
1000	About 1000 steps

Pattern observation: The time grows linearly as input size grows.

Final Time Complexity

Time Complexity: O(n)

This means the time needed grows in direct proportion to the input size.

Common Mistake

[X] Wrong: "Greedy always runs faster and is always better than DP."

[OK] Correct: Both can have similar time costs; the difference is in correctness, not speed.

Interview Connect

Understanding when to use Greedy or DP shows you can pick the right tool, a key skill interviewers look for.

Self-Check

"What if the problem had overlapping subproblems but no greedy choice property? How would the time complexity change if you tried greedy instead of DP?"

Practice

1. Which of the following best describes when to use a greedy algorithm instead of dynamic programming?

easy

A. When the problem has the greedy choice property and optimal substructure

B. When the problem requires checking all possible combinations

C. When the problem has overlapping subproblems but no greedy choice

D. When the problem is about sorting large datasets

Solution

1. Step 1: Understand greedy choice property

   A greedy algorithm works when choosing the best option at each step leads to a global optimum.

2. Step 2: Compare with dynamic programming conditions

   Dynamic programming is used when subproblems overlap and greedy choice property does not hold.

3. Final Answer:

   When the problem has the greedy choice property and optimal substructure -> Option A

4. Quick Check:

   Greedy choice property = Use greedy [OK]

Hint: Use greedy if local best leads to global best [OK]

Common Mistakes:

• Confusing overlapping subproblems with greedy choice
• Using greedy when problem needs full exploration
• Assuming sorting problems always need greedy

2. Which of the following is the correct syntax to declare a memoization array for dynamic programming in C?

easy

A. int memo[1000] = {0};

B. int memo[] = 0;

C. int memo(1000) = {0};

D. int memo = new int[1000];

Solution

1. Step 1: Recall C array declaration syntax

   In C, arrays are declared with fixed size and optional initialization using braces.

2. Step 2: Check each option

   int memo[1000] = {0}; correctly declares an int array of size 1000 initialized to zero. Others are invalid C syntax.

3. Final Answer:

   int memo[1000] = {0}; -> Option A

4. Quick Check:

   C arrays use [] with size [OK]

Hint: Use int arr[size] = {0} for zero-initialized arrays [OK]

Common Mistakes:

• Using parentheses instead of brackets for arrays
• Trying to assign 0 directly to array
• Using new keyword in C (it's C++ syntax)

3. What is the output of the following C code snippet that uses a greedy approach to select coins?

int coins[] = {1, 5, 10, 25};
int amount = 30;
int count = 0;
for (int i = 3; i >= 0; i--) {
    while (amount >= coins[i]) {
        amount -= coins[i];
        count++;
    }
}
printf("%d\n", count);

medium

A. 3

B. 4

C. 2

D. 5

Solution

1. Step 1: Trace the greedy coin selection

   Start with coin 25: amount=30, 30>=25, subtract 25, amount=5, count=1.

2. Step 2: Continue with smaller coins

   Next coin 10: amount=5<10, skip. Next coin 5: amount=5>=5, subtract 5, amount=0, count=2.

3. Step 3: No more coins needed

   Loop ends, total coins used = 2.

4. Final Answer:

   2 -> Option C

5. Quick Check:

   25 + 5 = 30 using 2 coins [OK]

Hint: Subtract largest coin repeatedly until amount zero [OK]

Common Mistakes:

• Counting coins incorrectly in loops
• Not updating amount after subtraction
• Confusing coin order in loop

4. The following code attempts to solve the Fibonacci sequence using a greedy approach. What is the error?

int fib(int n) {
    if (n <= 1) return n;
    int a = 0, b = 1, c = 0;
    for (int i = 2; i <= n; i++) {
        c = a + b;
        a = b;
        b = c;
    }
    return c;
}

medium

A. Loop should start from i = 1 instead of 2

B. No error, code correctly computes Fibonacci

C. Variable c is not initialized properly

D. Greedy approach is incorrect for Fibonacci calculation

Solution

1. Step 1: Understand Fibonacci calculation

   Fibonacci requires summing previous two numbers, which is a classic dynamic programming problem.

2. Step 2: Identify greedy approach misuse

   The code uses iteration correctly but calling it greedy is wrong because Fibonacci does not have greedy choice property.

3. Final Answer:

   Greedy approach is incorrect for Fibonacci calculation -> Option D

4. Quick Check:

   Fibonacci needs DP, not greedy [OK]

Hint: Fibonacci needs DP, greedy won't work [OK]

Common Mistakes:

• Thinking iterative is greedy
• Ignoring problem properties
• Confusing initialization with error

5. You want to find the minimum number of coins to make change for a given amount using coins of denominations {1, 3, 4}. Which approach is best and why?

hard

A. Greedy, because always picking the largest coin works here

B. Dynamic Programming, because greedy fails for some amounts

C. Brute force, because both greedy and DP are too complex

D. Sorting coins and picking smallest first

Solution

1. Step 1: Test greedy approach on example

   For amount 6, greedy picks 4 + 1 + 1 = 3 coins, but optimal is 3 + 3 = 2 coins.

2. Step 2: Recognize overlapping subproblems

   Dynamic programming stores solutions for smaller amounts to build up answer correctly.

3. Step 3: Conclude best approach

   Greedy fails due to lack of greedy choice property; DP handles all cases optimally.

4. Final Answer:

   Dynamic Programming, because greedy fails for some amounts -> Option B

5. Quick Check:

   Greedy fails, DP works [OK]

Hint: Test greedy on small cases; if fails, use DP [OK]

Common Mistakes:

• Assuming greedy always works for coin change
• Ignoring counterexamples
• Choosing brute force unnecessarily