Is this possible to do, if so how would you do it?
"If you had a number of cubes of different sizes, what would be the algorithm to figure out the smallest cube they could fit in?"
2026-03-27 10:31:22.1774607482
If you had a number of cubes of different sizes, what would be the algorithm to figure out the smallest cube they could fit in?
316 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
This is similar to bin packing problems-search for that. The simple heuristic is to sort them by size. Put the two largest next to each other. See if you can fit the rest into the empty space of the bounding cube. It is likely that you can unless you have lots of little ones as the cubes increase in volume so quickly. This is a greedy algorithm-there may be perverse cases where it fails to be optimal.