Greedy algorithm

Also written: greedy

An algorithm that takes the best-looking choice at each step and never undoes it. It is fast but is correct only when a reason, such as a swap argument, shows the choice is safe.