Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

Data Structures Bin Packing Problem.

Posted on 1997-08-19
2
Medium Priority
?
250 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 800 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

Industry Leaders: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

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…
Examines three attack vectors, specifically, the different types of malware used in malicious attacks, web application attacks, and finally, network based attacks.  Concludes by examining the means of securing and protecting critical systems and inf…
Video by: Grant
The goal of this video is to provide viewers with basic examples to understand and use nested-loops in the C programming language.
Video by: Grant
The goal of this video is to provide viewers with basic examples to understand and use while-loops in the C programming language.
Suggested Courses

963 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