Given a currency with denominations of 100, 50, 20, 10, 5 and 1 write a method MakeChange that takes an integer amount representing the total change to make and return an integer representing the smallest possible number of bills to return. For example a call of MakeChange(135) would result in a return value of 4 (1 one hundred bill, 1 twenty bill, 1 ten bill and 1 five bill). As part of a final solution please provide unit tests done as well as any test cases ran.
It is not our intention to break the school's academic policy. Projects posted are only used as a reference
and should not be submitted as is. We are not held liable for any misuse of the solutions.
Please see the frequently asked questions page
for further questions and inquiries.
Kindly fill out the form.
Please provide a valid email address and we'll get back to you in less than 24 hours.
We will be sending an invoice through PayPal upon confirmation.
We are a non profit organization however we need an amount to keep this organization running,
and to be able to complete our research and development.