4 ms·
Re-arranging elements optimally into different sized containers is clearly not trivial. It is an instance of the bin-packing problem, which is NP-complete.
by tatersolid 8y ago
Re-arranging elements optimally into different sized containers is clearly not trivial.
It is an instance of the bin-packing problem, which is NP-complete.