Informal greedy algorithms (opens in new tab)

Let's loosely define a greedy algorithm as one that always takes the locally best step. In surprisingly many algorithms, this turns out to be optimal. The...