Question: The bin packing problem is to pack the objects of various weights into containers. Assume each container can hold a maximum of 10 pounds. The
The bin packing problem is to pack the objects of various weights into containers. Assume each container can hold a maximum of 10 pounds. The program uses an algorithm that places an object with the smallest weight into the first bin in which it would fit. Your program should prompt the user to enter the total number of objects and the weight of each object. The program displays the total number of containers needed to pack the objects, and the contents of each container. Here is a sample run of the program:

Does this program produce an optimal solution, that is, finding the minimum number of containers to pack the objects?
Enter the number of objects: 6 Enter the weights of the objects: 752 3 58Jerier Container 1 contains objects with wei ght 2 3 5 Container 2 contains objects with weight 5 Container 3 contains objects with weight 7 Container 4 contains objects with weight 8
Step by Step Solution
3.33 Rating (162 Votes )
There are 3 Steps involved in it
import javautilArrayList import javautilArrays public class Exercise2226 public static void mainStri... View full answer
Get step-by-step solutions from verified subject matter experts
