Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency.
Nº Q3406279 ★
Common · Knowledge
Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency. It is also the most common variation of the coin change problem, a general case of partition in which, given the available denominations of an infinite set of coins, the objective is to find out the number of possible ways of making change for a specific amount of money, without considering the order of the coins. It is weakly NP-hard, but may be solved optimally in pseudo-polynomial time by dynamic programming.
Text: Wikipédia, CC BY-SA 4.0. · Image: Nandhp (Public domain) ·
Related cards
-
P versus NP problem
Unsolved problem in computer science about time complexity
Nº Q746242 ★★★★
Not listed
-
Coin problem
Problem in number theory
Nº Q2295746 ★★
Not listed
-
Vertex-cover problem
Set of vertices incident on every edge
Nº Q924362 ★
Not listed
-
Coupon collector's problem
Probability Theory
Nº Q1148012 ★★
Not listed
-
Modular arithmetic
System of algebraic operations defined for remainders under division by a fixed positive integer; system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus
Nº Q319400 ★★★
Not listed
-
Knapsack problem
Problem in combinatorial optimization
Nº Q864457 ★★★
Not listed