Algorithms that try to find the immediate short-term (also known as locally optimal) solution are considered greedy. it makes the best local choice at a given stage. while greedy algorithms are straightforward, they are not always correct, such as with hill climbing. Some algorithms are, however optimal
Greedy Argument can be used to prove the correctness and/or optimality of greedy algorithms