Greedy algorithms

Greedy algorithms are those that make locally optimal choices. This means at each step the algorithm selects the best option available at the time, not considering the effect this will have on future choices.

Greedy algorithms covered:

• Interval scheduling
• Interval partitioning
• Scheduling to minimise maximum lateness
• Dijkstra's shortest path algorithm
• Minimum spanning tree algorithms