Solved

Data Structures Bin Packing Problem.

Posted on 1997-08-19
2
243 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
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
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

What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

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…
This is a short and sweet, but (hopefully) to the point article. There seems to be some fundamental misunderstanding about the function prototype for the "main" function in C and C++, more specifically what type this function should return. I see so…
Video by: Grant
The goal of this video is to provide viewers with basic examples to understand and use for-loops 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.

623 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