Algorithms · Level 2 of 5
Greedy Algorithm
A procedure that chooses a locally preferred option at each step.
Local choices produce a global optimum only for certain problem structures.
Example
An algorithm repeatedly selects the currently cheapest eligible edge.
Listen to the definition and example
Audio transcript
Greedy Algorithm. A procedure that chooses a locally preferred option at each step. Local choices produce a global optimum only for certain problem structures. For example: An algorithm repeatedly selects the currently cheapest eligible edge.
Explore this concept
Why it matters
This helps you compare problem-solving methods and their computational tradeoffs.
Start with
Related concepts
Quick recall question
Try answering before looking back at the definition.