Greedy Algorithm

A constructive method that builds a solution step-by-step by making a locally optimal choice at each stage, used in combinatorial optimization, approximation algorithms, and existence proofs where local decisions can be shown to lead to a globally acceptable solution.