Why Greedy Works and When It Fails in DSA C++ - Why It Works

Concept Flow - Why Greedy Works and When It Fails

Start Problem

↓

Choose Best Local Option

↓

Add to Solution

↓

Is Solution Complete?

No→Repeat Choose Best Local Option

Yes↓

Return Final Solution

↓

Check if Greedy is Optimal

↓

If Yes: Greedy Works

↓

If No: Greedy Fails

The greedy approach picks the best local choice repeatedly until the solution is complete, then checks if this leads to a global optimum or not.

Execution Sample

DSA C++

int coins[] = {25, 10, 5, 1};
int amount = 30;
int count = 0;
for (int i = 0; i < 4; i++) {
  while (amount >= coins[i]) {
    amount -= coins[i]; count++;
  }
}

This code picks the largest coin repeatedly to make change for 30 cents using greedy.

Execution Table

Step	Operation	Amount Left	Coins Used	Visual State
1	Start with amount=30	30	0	[]
2	Check coin 25	30	0	[]
3	Use coin 25	5	1	[25]
4	Check coin 25 again	5	1	[25]
5	Move to coin 10	5	1	[25]
6	Check coin 10	5	1	[25]
7	Move to coin 5	5	1	[25]
8	Use coin 5	0	2	[25, 5]
9	Amount is 0, done	0	2	[25, 5]

💡 Amount reached 0, solution complete with 2 coins.

Variable Tracker

Variable	Start	After Step 3	After Step 8	Final
amount	30	5	0	0
count	0	1	2	2
coins_used	[]	[25]	[25, 5]	[25, 5]

Key Moments - 3 Insights

Why does the greedy method pick the largest coin first?

Because picking the largest coin reduces the remaining amount fastest, as shown in steps 3 and 8 in the execution_table.

When can greedy fail to find the best solution?

Greedy fails if the local best choice doesn't lead to the global best, for example if coin denominations are {10, 6, 1} and amount is 12, greedy picks 10 + 1 + 1 = 3 coins but optimal is 6 + 6 = 2 coins.

Why do we check if the solution is complete after each choice?

To stop the process once the target is reached, as shown in step 9 where amount is 0 and the loop ends.

Visual Quiz - 3 Questions

Look at the execution_table, how many coins are used after step 8?

A 2

B 3

C 1

D 0

💡 Hint

Check the 'Coins Used' column at step 8 in the execution_table.

At which step does the amount become zero?

A Step 7

B Step 8

C Step 9

D Step 6

💡 Hint

Look at the 'Amount Left' column in the execution_table to find when it reaches 0.

If the coin denominations were {10, 6, 1} and amount 12, what would greedy pick first?

A Two 6 coins

B Twelve 1 coins

C One 10 coin

D One 6 coin

💡 Hint

Greedy picks the largest coin first, so check the largest coin in the set.

Concept Snapshot

Greedy Algorithm:
- Pick best local choice at each step
- Repeat until solution complete
- Works if local choices lead to global optimum
- Fails if local best misleads
- Example: coin change with standard coins

Full Transcript

The greedy algorithm solves problems by choosing the best option available at each step without reconsidering previous choices. This works well when local best choices lead to the overall best solution, such as making change with standard coin denominations. The example code picks the largest coin repeatedly until the amount is zero. The execution table shows how the amount decreases and coins used increase step by step. However, greedy can fail if the local best choice does not lead to the global best, like with unusual coin sets. It's important to check if the solution is complete after each choice to stop the process. Understanding when greedy works or fails helps choose the right approach for a problem.

Practice

1. What is the main reason a greedy algorithm works correctly for some problems?

easy

A. Because it makes the best choice at each step hoping for a global optimum

B. Because it tries all possible solutions and picks the best one

C. Because it uses recursion to explore all paths

D. Because it sorts the input data before processing

Solution

1. Step 1: Understand greedy choice property

   A greedy algorithm picks the best option available at each step without reconsidering previous choices.

2. Step 2: Connect greedy choice to global optimum

   This local best choice leads to a global optimum only if the problem has the greedy choice property and optimal substructure.

3. Final Answer:

   Because it makes the best choice at each step hoping for a global optimum -> Option A

4. Quick Check:

   Greedy = local best choice [OK]

Hint: Greedy picks best now, not all possibilities [OK]

Common Mistakes:

• Thinking greedy tries all solutions
• Confusing greedy with backtracking
• Assuming sorting alone makes greedy work

2. Which of the following is the correct syntax to select the next item in a greedy algorithm loop in C++?

easy

A. for (auto item : items) { choose item; }

B. for (int i = 0 i < n; i++) { choose item[i]; }

C. while (i <= n) { choose item[i]; i++; }

D. do { choose item[i]; i--; } while (i > 0);

Solution

1. Step 1: Identify correct C++ loop syntax for iteration

   The range-based for loop for (auto item : items) is modern and correct for iterating over a container.

2. Step 2: Check other options for correctness

   for (int i = 0 i < n; i++) { choose item[i]; } is missing semicolons and proper syntax. while (i <= n) { choose item[i]; i++; } uses while but lacks initialization shown. do { choose item[i]; i--; } while (i > 0); decrements i incorrectly.

3. Final Answer:

   for (auto item : items) { choose item; } -> Option A

4. Quick Check:

   Range-based for loop is correct syntax [OK]

Hint: Use range-based for loops for clean iteration [OK]

Common Mistakes:

• Missing semicolons in for loop
• Using wrong loop conditions
• Decrementing index when should increment

3. Consider the following C++ code snippet for selecting intervals greedily by earliest finish time:

struct Interval {
  int start, end;
};

bool compare(Interval a, Interval b) {
  return a.end < b.end;
}

int main() {
  std::vector<Interval> intervals = {{1,4}, {3,5}, {0,6}, {5,7}, {8,9}};
  std::sort(intervals.begin(), intervals.end(), compare);
  int count = 0, last_end = -1;
  for (auto interval : intervals) {
    if (interval.start >= last_end) {
      count++;
      last_end = interval.end;
    }
  }
  std::cout << count << std::endl;
  return 0;
}

What is the output of this program?

medium

A. 5

B. 4

C. 3

D. 2

Solution

1. Step 1: Sort intervals by end time

   Sorted intervals by end: {1,4}, {3,5}, {0,6}, {5,7}, {8,9}

2. Step 2: Select intervals greedily

   Select {1,4} (count=1, last_end=4), skip {3,5} (start 3 < 4), skip {0,6} (start 0 < 4), select {5,7} (start 5 >= 4, count=2, last_end=7), select {8,9} (start 8 >= 7, count=3, last_end=9)

3. Step 3: Count total selected intervals

   Total selected intervals = 3

4. Final Answer:

   3 -> Option C

5. Quick Check:

   Greedy interval selection count = 3 [OK]

Hint: Sort by finish time, pick non-overlapping intervals [OK]

Common Mistakes:

• Counting overlapping intervals
• Not sorting intervals correctly
• Updating last_end incorrectly

4. The following code attempts to solve the coin change problem using a greedy approach:

int coins[] = {25, 10, 5, 1};
int amount = 30;
int count = 0;
for (int i = 0; i < 4; i++) {
  while (amount >= coins[i]) {
    amount -= coins[i];
    count++;
  }
}
std::cout << count << std::endl;

What is the main issue with this greedy approach?

medium

A. It always gives the minimum number of coins

B. It may fail for some coin sets where greedy is not optimal

C. It causes a syntax error due to missing semicolons

D. It runs infinitely because amount never decreases

Solution

1. Step 1: Understand greedy coin change approach

   The code picks largest coin repeatedly until amount is reduced to zero.

2. Step 2: Identify greedy failure cases

   Greedy works for US coins but fails for some coin sets where smaller coins combined give fewer coins than greedy picks.

3. Final Answer:

   It may fail for some coin sets where greedy is not optimal -> Option B

4. Quick Check:

   Greedy coin change can fail [OK]

Hint: Greedy coin change fails on non-canonical coin sets [OK]

Common Mistakes:

• Assuming greedy always gives minimum coins
• Confusing syntax errors with logic errors
• Ignoring infinite loop possibility

5. You want to select activities to attend from a list with start and end times. The greedy algorithm picks the earliest finishing activity first. However, if activities have the same end time, it picks the one with the earliest start time. Why might this tie-break rule cause the greedy algorithm to fail in some cases?

hard

A. Because tie-break rules do not affect greedy correctness

B. Because earliest start time always leads to the best solution

C. Because sorting by end time is not needed in greedy algorithms

D. Because picking earliest start time among ties may block more future activities

Solution

1. Step 1: Understand tie-breaking in activity selection

   Greedy sorts by earliest finish time. Ties in end time use earliest start as tie-breaker.

2. Step 2: Analyze effect on greedy selection

   Picking the earliest start time among tied end times may block more future activities, reducing the total number of activities selected.

3. Step 3: Confirm impact on optimality

   This tie-break rule can cause the greedy algorithm to fail to find the maximum set of non-overlapping activities.

4. Final Answer:

   Because picking earliest start time among ties may block more future activities -> Option D

5. Quick Check:

   Tie-break can affect future selections [OK]

Hint: Tie-breaks can affect greedy correctness when ends tie [OK]

Common Mistakes:

• Thinking tie-breaks do not affect optimality
• Assuming all tie-breaks are harmless
• Ignoring impact of start times on future choices