Data Structures and Algorithms · Techniques

Greedy algorithms

Making the locally best choice at every step and trusting it leads to a globally best answer.

Also known as: greedy choice property, activity selection.

Start a lesson on Greedy algorithms

Learn first

• Minimum spanning trees: The cheapest set of edges that connects every vertex with no cycles.

Related topics

• Dynamic programming: Solving a problem by caching answers to overlapping subproblems instead of recomputing them.
• Minimum spanning trees: The cheapest set of edges that connects every vertex with no cycles.