• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 253
  • Last Modified:

Data Structures Bin Packing Problem.

Explain how to implement first fit and best fit bin
packing algorithms in 0(NlogN) time rather than the
usual O(N^2) time that it takes to scan down the list
of bins sequentially.
1 Solution
Instead of scanning the list sequentially, use a binary search.  This sure sounds like homework to me.

knight7zAuthor Commented:
It was actually a question on a take home final! :)

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Easily manage email signatures in Office 365

Managing email signatures in Office 365 can be a challenging task if you don't have the right tool. CodeTwo Email Signatures for Office 365 will help you implement a unified email signature look, no matter what email client is used by users. Test it for free!

Tackle projects and never again get stuck behind a technical roadblock.
Join Now