Related Problems
The "optimal denomination problem" is a problem for people who design entirely new currencies: What denominations should be chosen for the coins in order to minimize the average cost of making change -- i.e., the average number of coins needed to make change? The version of this problem assumed that the people making change will use the minimum number of coins (from the denominations available). One variation of this problem assumes that the people making change will use the "greedy algorithm" for making change, even when that requires more than the minimum number of coins. Most current currencies use a 1-2-5 series, but some other set of denominations would require fewer denominations of coins or a smaller average number of coins to make change or both.
Read more about this topic: Change-making Problem
Famous quotes containing the words related and/or problems:
“Gambling is closely related to theft, and lewdness to murder.”
—Chinese proverb.
“I have a horror of people who speak about the beautiful. What is the beautiful? One must speak of problems in painting!”
—Pablo Picasso (1881–1973)