Why Greedy Works and When It Fails in DSA Go - Performance Analysis

Time Complexity: Why Greedy Works and When It Fails

O(k)

Understanding Time Complexity

We want to understand how fast greedy algorithms run and why they sometimes give the best answer quickly.

When does greedy work well, and when does it take longer or fail?

Scenario Under Consideration

Analyze the time complexity of a simple greedy approach to the coin change problem.

package main

import "fmt"

func greedyCoinChange(coins []int, amount int) int {
    count := 0
    for i := len(coins) - 1; i >= 0; i-- {
        count += amount / coins[i]
        amount %= coins[i]
    }
    return count
}

func main() {
    coins := []int{1, 5, 10, 25}
    amount := 63
    fmt.Println(greedyCoinChange(coins, amount))
}

This code picks the largest coin first and uses as many as possible before moving to smaller coins.

Identify Repeating Operations

Look at the loops and repeated steps:

• Primary operation: Loop over the coin types once.
• How many times: Once per coin type, so number of coins (k).

How Execution Grows With Input

The time depends on how many coin types we have, not the amount.

Input Size (number of coins k)	Approx. Operations
4	4 steps
10	10 steps
100	100 steps

Pattern observation: The work grows linearly with the number of coin types, not the amount to change.

Final Time Complexity

Time Complexity: O(k)

This means the algorithm runs quickly as long as the number of coin types is small, regardless of the amount.

Common Mistake

[X] Wrong: "Greedy always finds the best answer for any coin set."

[OK] Correct: Greedy can fail if coin values don't fit nicely, missing the minimum coins needed.

Interview Connect

Understanding when greedy works helps you choose the right approach quickly and explain your reasoning clearly in interviews.

Self-Check

"What if the coin denominations were not sorted or included unusual values? How would that affect the greedy algorithm's time complexity and correctness?"

Practice

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

easy

A. Because it sorts the input data before processing

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

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

D. Because it uses recursion to explore all paths

Solution

1. Step 1: Understand greedy choice property

   A greedy algorithm makes the best local choice at each step, aiming for a global best solution.

2. Step 2: Differentiate from exhaustive search

   Unlike trying all solutions or recursion, greedy does not explore all paths but relies on local optimality.

3. Final Answer:

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

4. Quick Check:

   Greedy choice property = Because it makes the best choice at each step hoping for a global optimum [OK]

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

Common Mistakes:

• Confusing greedy with exhaustive search
• Thinking greedy always tries all solutions
• Assuming sorting alone makes greedy correct

2. Which of the following Go code snippets correctly implements a greedy step to pick the largest number from a slice?

easy

A. max := nums[0]
for _, v := range nums {
if v > max {
max = v
}
}

B. max := 0
for i := 1; i < len(nums); i++ {
if nums[i] < max {
max = nums[i]
}
}

C. max := nums[0]
for i := 0; i < len(nums); i++ {
if nums[i] < max {
max = nums[i]
}
}

D. max := nums[0]
for _, v := range nums {
if v < max {
max = v
}
}

Solution

1. Step 1: Identify correct max initialization and comparison

   Initialize max with first element and update if current value is greater.

2. Step 2: Check loop and condition correctness

   max := nums[0] for _, v := range nums { if v > max { max = v } } uses correct range loop and updates max when v > max.

3. Final Answer:

   Option A correctly finds the largest number -> Option A

4. Quick Check:

   Correct max update condition = max := nums[0] for _, v := range nums { if v > max { max = v } } [OK]

Hint: Update max only if current value is greater [OK]

Common Mistakes:

• Using '<' instead of '>' to find max
• Initializing max to zero instead of first element
• Comparing incorrectly inside loop

3. What will be the output of the following Go code that tries to select intervals greedily by earliest finish time?

package main
import "fmt"
func main() {
  intervals := [][]int{{1,4},{3,5},{0,6},{5,7},{8,9},{5,9}}
  selected := [][]int{}
  lastEnd := 0
  for _, interval := range intervals {
    if interval[0] >= lastEnd {
      selected = append(selected, interval)
      lastEnd = interval[1]
    }
  }
  fmt.Println(selected)
}

medium

A. [[1 4] [5 7] [8 9]]

B. [[1 4] [3 5] [5 7] [8 9]]

C. [[0 6] [8 9]]

D. [[1 4] [5 9]]

Solution

1. Step 1: Understand greedy selection by earliest finish time

   Intervals are checked in given order; select if start >= last selected end.

2. Step 2: Trace selection step-by-step

   Selected intervals: [1,4] (lastEnd=4), skip [3,5], skip [0,6], select [5,7] (lastEnd=7), select [8,9].

3. Final Answer:

   [[1 4] [5 7] [8 9]] -> Option A

4. Quick Check:

   Greedy interval selection = [[1 4] [5 7] [8 9]] [OK]

Hint: Pick intervals starting after last end time [OK]

Common Mistakes:

• Not updating lastEnd correctly
• Selecting overlapping intervals
• Assuming input is sorted by finish time

4. The following Go code tries to solve the coin change problem greedily but sometimes fails. What is the bug?

package main
import "fmt"
func main() {
  coins := []int{25, 10, 5, 1}
  amount := 30
  count := 0
  for _, coin := range coins {
    count += amount / coin
    amount = amount % coin
  }
  fmt.Println(count)
}

medium

A. The coins slice is not sorted in ascending order

B. The greedy approach fails for some coin sets, but code logic is correct

C. The code does not update amount correctly inside the loop

D. The count variable should be reset inside the loop

Solution

1. Step 1: Analyze greedy coin change logic

   The code picks largest coins first, counting how many fit, updating amount correctly.

2. Step 2: Understand greedy failure cases

   Greedy works for US coins but fails for some coin sets; code logic is correct but approach can fail.

3. Final Answer:

   The greedy approach fails for some coin sets, but code logic is correct -> Option B

4. Quick Check:

   Greedy correctness depends on coin set = The greedy approach fails for some coin sets, but code logic is correct [OK]

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

Common Mistakes:

• Thinking code has syntax or logic error
• Assuming coin order must be ascending
• Resetting count inside loop incorrectly

5. You want to schedule the maximum number of non-overlapping meetings from a list of start and end times. Which greedy strategy guarantees the optimal solution?

hard

A. Always pick the meeting with the latest start time

B. Always pick the meeting with the shortest duration

C. Always pick the meeting with the earliest start time

D. Always pick the meeting with the earliest finish time

Solution

1. Step 1: Recall interval scheduling greedy strategy

   The proven greedy method is to pick meetings finishing earliest to maximize remaining time.

2. Step 2: Compare other strategies

   Picking earliest start or shortest duration can cause overlaps and miss optimal count.

3. Final Answer:

   Always pick the meeting with the earliest finish time -> Option D

4. Quick Check:

   Earliest finish time strategy = Always pick the meeting with the earliest finish time [OK]

Hint: Pick meetings finishing earliest to maximize schedule [OK]

Common Mistakes:

• Choosing earliest start time instead of finish time
• Picking shortest duration meetings incorrectly
• Assuming latest start time works best