Reference no: EM133247074

Assignment:

Create an algorithm for the following program: Vending Machine Change

Items distributed by a vending machine cost from 5 cents to $1.00 each, but the vending machine accepts only a single dollar bill for each item.

Determine how to distribute change using the fewest number of quarters, dimes, nickels, and pennies for an item.

Examples:

• If the user purchases an item that costs 55 cents, your vending machine will return 45 cents change as follows: 1 quarter, 2 dimes, 0 nickels, and 0 pennies.
• If the user purchases an item that costs 6 cents, then your vending machine will return 94 cents change: 3 quarters, 1 dime, 1 nickel, and 4 pennies.

Your algorithm should be able to make make change for every possible amount of change from 5 cents to 99 cents. Simply giving examples like the two above which describe specific instances is not an algorithm.

An algorithm that describes how to make change for each cost from 5 cents to 99 cents (using 90+ "if" statements) also is not acceptable.