Change in OCaml
Correctly determine change to be given using the least number of coins
exercism fetch ocaml 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.
- 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]
- 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?
For installation and learning resources, refer to the exercism help page.
To work on the exercises, you will need
Core. Consult opam website for instructions on how to install
opam for your OS. Once
opam is installed open a terminal window and run the following command to install core:
opam install core
To run the tests you will need
OUnit. Install it using
opam install ounit
A Makefile is provided with a default target to compile your solution and run the tests. At the command line, type:
utop is a command line program which allows you to run Ocaml code interactively. The easiest way to install it is via opam:
opam install utop
Consult utop for more detail.
Feedback, Issues, Pull Requests
The exercism/ocaml repository on GitHub is the home for all of the Ocaml exercises.
If you have feedback about an exercise, or want to help implementing a new one, head over there and create an issue. We'll do our best to help you!
Software Craftsmanship - Kata-logue 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.