Q286
Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm NOT produce an optimal answer?
A.
20
B.
12
C.
6
AnswerD.
5
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board