Greedy algorithms

Problems on greedy algorithms, including scheduling intervals and deadlines, giving change with coins, choosing items by value per unit, merging with the cheapest cost, covering segments with points, and building the largest or smallest number from digits.

The sorting article in the Basics section and the priority queue article cover the usual tools. Related problem sets are under Sorting, Priority queue and Constructive algorithms.