Solved

Data Structures Bin Packing Problem.

Posted on 1997-08-19
2
216 Views
Last Modified: 2008-03-10
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.
0
Comment
Question by:knight7z
2 Comments
 
LVL 1

Accepted Solution

by:
peter_vc earned 200 total points
ID: 1253429
Instead of scanning the list sequentially, use a binary search.  This sure sounds like homework to me.

0
 

Author Comment

by:knight7z
ID: 1253430
It was actually a question on a take home final! :)
Thanks!

0

Featured Post

Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Summary: This tutorial covers some basics of pointer, pointer arithmetic and function pointer. What is a pointer: A pointer is a variable which holds an address. This address might be address of another variable/address of devices/address of fu…
Windows programmers of the C/C++ variety, how many of you realise that since Window 9x Microsoft has been lying to you about what constitutes Unicode (http://en.wikipedia.org/wiki/Unicode)? They will have you believe that Unicode requires you to use…
The goal of this video is to provide viewers with basic examples to understand opening and writing to files in the C programming language.
The goal of this video is to provide viewers with basic examples to understand recursion in the C programming language.

863 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

22 Experts available now in Live!

Get 1:1 Help Now