Sha256: f0397e33fa6f107531cfb15221d024a4d488d9bc97fa47512ed530cd0dc33667
Contents?: true
Size: 1.15 KB
Versions: 107
Compression:
Stored size: 1.15 KB
Contents
# Change
Correctly determine the fewest number of coins to be given to a customer such
that the sum of the coins' value would equal the correct amount of change.
## For example
- An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5)
and one dime (10) or [0, 1, 1, 0, 0]
- An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5)
and one dime (10) and one quarter (25) or [0, 1, 1, 1, 0]
## Edge cases
- Does your algorithm work for any given set of coins?
- Can you ask for negative change?
- Can you ask for a change value smaller than the smallest coin value?
## Making the Test Suite Pass
1. Get [PHPUnit].
% wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
% chmod +x phpunit.phar
2. Execute the tests for an assignment.
% phpunit.phar wordy/wordy_test.php
[PHPUnit]: http://phpunit.de
## Source
Software Craftsmanship - Kata-logue [http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata](http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata)
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
107 entries across 107 versions & 1 rubygems