File:Greedy algorithm 36 cents.svg
Original file (SVG file, nominally 965 × 710 pixels, file size: 2 KB)
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
January 10, 2019: The Algorithmic Paradigm Treaty Organization (APTO) files math crime charges against greedy algorithms.
Fiction cross-reference
Nonfiction cross-reference
External links:
- Greedy algorithm @ Wikipedia
Attribution: By Nandhp - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=10220978
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 09:52, 3 September 2018 | | 965 × 710 (2 KB) | Admin (talk | contribs) | 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... |
You cannot overwrite this file.
File usage
The following 6 pages use this file:
