Solved

Data Structures Bin Packing Problem.

Posted on 1997-08-19
2
202 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
Comment Utility
Instead of scanning the list sequentially, use a binary search.  This sure sounds like homework to me.

0
 

Author Comment

by:knight7z
Comment Utility
It was actually a question on a take home final! :)
Thanks!

0

Featured Post

Threat Intelligence Starter Resources

Integrating threat intelligence can be challenging, and not all companies are ready. These resources can help you build awareness and prepare for defense.

Join & Write a Comment

Suggested Solutions

Title # Comments Views Activity
How do I test for current date? 9 90
c language help - file paths 7 113
jquery/ajax to code behind 7 157
Grammars for C C++ and java 1 108
Have you thought about creating an iPhone application (app), but didn't even know where to get started? Here's how: ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ Important pre-programming comments: I’ve never tri…
This tutorial is posted by Aaron Wojnowski, administrator at SDKExpert.net.  To view more iPhone tutorials, visit www.sdkexpert.net. This is a very simple tutorial on finding the user's current location easily. In this tutorial, you will learn ho…
The goal of this video is to provide viewers with basic examples to understand and use pointers in the C programming language.
The goal of this video is to provide viewers with basic examples to understand and use conditional statements in the C programming language.

772 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

14 Experts available now in Live!

Get 1:1 Help Now