Design an algorithm to solve the above scenario for N boxes. [The efficiency of your algorithm is the main driver of the mark], and analyze the complexity of your solution. [full explanation of your answer should be provided]
In stores, boxes should be placed in an organized way otherwise it will be messy. Given a
collection of boxes, it is requested to place them on top of each other to reach the
minimum possible height. There is a condition, where a box cannot be placed on top of
another box unless the area of its 2D base is smaller or equal of the 2D base of the lower
box. It is allowed to rotate any box to use any two sides as its base.
a) Describe how a brute-force approach
b) Design an algorithm to solve the above scenario for N boxes. [The
efficiency of your algorithm is the main driver of the mark], and analyze the complexity
of your solution. [full explanation of your answer should be provided]
c) Develop a python code to implement your efficient algorithm.
d) Prepare a brief report (250 words) comparing the two algorithms
Step by step
Solved in 2 steps
