Skip to content
UPEEC

Greedy Algorithms

Make the locally best choice at each step.

Intermediate
Comments 0

Works when the greedy-choice property holds: activity selection, Huffman coding, Kruskal/Prim, coin change with standard coins. Prove it or find a counterexample.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.