function MakeChange (int n) 
{
  /* Makes change for n units using the minimal number of coins */
  const CoinSet = {1, 5, 10, 25, 50, 100}
  SolutionSet = empty set ;
  sum = 0 ;
  while (sum < n) do
  {
    coin = largest coin in CoinSet such that sum + value(coin) <= n ;
    if there is no such coin then return "no solution found"
    SolutionSet = SolutionSet + {coin} ;
    sum += value(coin) ;
  }
  return SolutionSet ;
}