View source for File:Greedy algorithm 36 cents.svg

Nonfiction: [[Greedy algorithm (nonfiction)|Greedy algorithms]] determine minimum number of coins to give while making change. These are the steps a human would take to emulate a greedy algorithm to represent 36 cents using only coins with values {1, 5, 10, 20}. The coin of the highest value, less than the remaining change owed, is the local optimum. (In general the change-making problem requires dynamic programming to find an optimal solution; however, most currency systems, including the Euro and US Dollar, are special cases where the greedy strategy does find an optimal solution.)

== In the News ==

<gallery>
</gallery>

== Fiction cross-reference ==

* [[Crimes against mathematical constants]]
* [[Gnomon algorithm]]
* [[Gnomon Chronicles]]
* [[Mathematics]]

== Nonfiction cross-reference ==

* [[Greedy algorithm (nonfiction)]]
* [[Greedy coloring (nonfiction)]]
* [[Mathematics (nonfiction)]]

External links:

* [https://en.wikipedia.org/wiki/Greedy_coloring Greedy coloring] @ Wikipedia

Attribution: By Nandhp - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=10220978

[[Category:Nonfiction (nonfiction)]]
[[Category:Mathematicians (nonfiction)]]