corejavatutorialJanuary 5, 2016

Write a program that implements change making solution. Assume that the cashier has currency notes in the denominations Rs. 100, Rs. 50, Rs. 20, Rs. 10, Rs. 5 and Rs. 1 in addition to coins . Program should include a method to input the purchase amount and the amount given by the customer as well as method to output the amount of change and a breakdown by denomination. Apply greedy algorithm at the cahier side that is give less number of coins if sufficient currency of that denomination available.

The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations?…