'Will Furniture shipping problem give optimal solution? (greedy)
There is a problem from this book called Grokking Algorithm, chapter 8, problem no 8.1
You work for a furniture company, and you have to ship furniture all over the country. You need to pack your truck with boxes. All the boxes are of different sizes, and you’re trying to maximize the space you use in each truck. How would you pick boxes to maximize space? Come up with a greedy strategy. Will that give you the optimal solution?
What is meant by optimal solution here?
If I try to apply greedy Algo here, will that give me optimal solution?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|