Definition: An algorithm that
always takes the best immediate, or local, solution while finding an answer.
Greedy algorithms find the overall, or globally, optimal solution for
some optimization problems, but may find less-than-optimal solutions
for some instances of other problems.
