easy5 pts · first answer countsdynamic-programminggreedy
When the greedy coin choice fails
Coins are 1, 3 and 4. Greedy always takes the largest coin that fits. For amount 6, how many coins does greedy use, and what is the true minimum?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Fibonacci after adding a cacheBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer