Making Change:
Based on input from the user, the program must calculate the change returned for any amount charged based (where both are positive values).
The solution must determine the minimum number of bills and coins returned as change (i.e. return one dime and not two nickels). The results must be a readable list of the denomination and number of bills / coins returned.
Assume we have the following denominations available:
Bills: $50.00, $20.00, $10.00, $5.00
Coins: twoonies, loonies, quarters, dimes, nickels and pennies.
Note: Normally, one would ‘error-check’ the user input for positive number, numbers that include fractions of nickels, and would check to ensure the amount tendered will cover the amount charged. DO NOT DO SO IN YOUR SOLUTION. Assume the user will input valid amounts correctly. Be aware though, user entering such numbers may cause the program to crash or may result in erroneous output.
If you don’t understand the problem, ask!!
Algorithm Design
? Develop an algorithm that solves the above Making Change Problem. Express the algorithm as we do in class as pseudo-code. To assist you with the algorithm, solve the problem using this sample data: $139.11 as the amount of purchase, and $ 550 as the amount tendered.
Save and submit a record of a desk check- a tracing of your algorithm with appropriate values along with the pseudo-code.
The algorithm needs to be explicit, precise, unambiguous, correct, complete and finite.