given the boxes with dimentions in form (L,B,H) find the sequence in which the boxes can be stored inside the other.
for eg. a=4,4,5 b=3,4,3 c=3,4,6 d=2,3,2 a(b(d)) without rotation : is this correct logic sort on the basis of length and breadth and height then find lis on the basis of height starting from the bottom most box in the sorted sequence what for rotation case -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
