sorry,no need combination trying also .take first and second set in
sorted list.
largest element in first set should be greater than largest element in
second set.
this repeated for second and third largest elements also in the set.if
this is satisfied,go for picking boxes i the sorted order of
volumes.if this is not satisfied at any case packing is not possible
with all given boxes










On Sep 22, 5:56 pm, rajess <rajeshrules...@yahoo.com> wrote:
> sort boxes according to volume.volume pair consists of(l,b,h).
> take first box having higher volume in sorted order with attribute
> (l,b,h)
> choose next volume box in sorted order.take its pair (l,b,h)
> do a combination between these pairs comparing this attributes in all
> possible ways and if their exists a combination break this and proceed
> with next box and if no combination exists these boxes cant be packed.
>
> combination means trying some way to achieve all elements in second
> pair having one element greater than that in first pair..

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to