medium10 pts · first answer countsdynamic-programminggreedyknapsack
Where value-per-kg greedy works
A trader fills a truck by taking goods with the highest value per kg first. For which problem is this greedy rule always optimal?
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