HacktoberFest2021
HacktoberFest2021 copied to clipboard
Greedy-Algorithm_Finding-minimum-coins.cpp
Given a value V, if we want to make a change for V Rs, and we have an infinite supply of each of the denominations in Indian currency, i.e., we have an infinite supply of { 1, 2, 5, 10, 20, 50, 100, 500, 1000} valued coins/notes, what is the minimum number of coins and/or notes needed to make the change? I have solved the above question using the Greedy Algorithm.