Skip to content
All projects

ChangeMaker

Computes the fewest bills and coins needed to make change using dynamic programming, with probability-based coin selection when a denomination runs low.

  • C++
  • Dynamic programming

A C++ program that uses dynamic programming to work out the fewest bills and coins needed to make change for an amount.

When a denomination is running low, it picks coins using probabilities instead of always taking the minimum.