The greedy paradigm is a problem solving approach for algorithms where the goal is to find the immediate short-term (also known as locally optimal) solution. An algorithm making use of this paradigm (a greedy algorithm) makes the best local choice at a given stage. While greedy algorithms are straightforward, they are not always correct or optimal, such as with hill climbing.
Greedy Optimal
Very few algorithms are greedy and optimal, which means they provide the best possible solution locally and globally.
These include:
Greedy Argument can be used to prove the correctness and/or optimality of greedy algorithms