@monsieur: we can't solve the problem by the way u suggest because we have to sort it by bin number but we have to find the first fit according to the left over space in the bin. So, in the worst case it will take more than O(n*log(n))time.... If u need any clarifications feel free to comment
regards, Ankit On Tue, May 17, 2011 at 5:52 AM, MONSIEUR <monsieur....@gmail.com> wrote: > guys why cant we simply sort bins using merge sort or any comparison > sort and then use binary search to find out the first available > bin.t(n)=O(nlgn)+n*(lgn)=O(nlgn). > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
