Track 16 · Lesson 9 of 12

Greedy algorithms

Build a solution one locally best choice at a time — making change, scheduling bookings, packing tasks — and learn to recognise when greedy gives the wrong answer.

You will be able to

• Describe a greedy algorithm as a sequence of locally best, never-undone choices
• Make change greedily and schedule the most non-overlapping bookings by earliest end time
• Explain why the choice of greedy rule matters, using counterexamples
• Recognise problems where greedy fails and a more thorough method is needed