Give an example set of denominations of coins so that a greedy change-making algorithm will not use

Question:

Give an example set of denominations of coins so that a greedy change-making algorithm will not use the minimum number of coins.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Structures and Algorithms in Java

ISBN: 978-1118771334

6th edition

Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Question Posted: