Greedy Algorithms
Back: Algorithms
Algorithms that make the locally optimal choice at each step with the hope of finding a global optimum. Greedy algorithms are simpler and faster than dynamic programming but only work when the greedy choice property and optimal substructure are present.