Question: A greedy algorithm can be used to solve the Making Change problem for US denominations, yet the project required dynamic programming for the denominations
A greedy algorithm can be used to solve the "Making Change" problem for US denominations, yet the project required dynamic programming for the denominations used. Explain why US denominations are different and why that changes the nature of the solution
Step by Step Solution
There are 3 Steps involved in it
The Making Change problem involves finding the minimum number of coins needed to make change for a given amount using a specific set of coin denominat... View full answer
Get step-by-step solutions from verified subject matter experts
