Flowgorithm - ATM Task
This is my version of the ATM task. Where a value is requested from a cash machine and it then issues the right bank notes using the least amount of note possible
This is also referred to as the Vending Machine task eg the request recently on facebook below
The prices of the vending machines were 5,000 won, 1,000 won, 500 won, 100 won, 50 won, and 10 won.
If the amount to be returned is 6,750 won, 1 5,000 won, 1 1,000 won, 1 500 won, 2 100 won, 1 50 won