slbelden / 3020-Project3

Bin Packing
0 stars 0 forks source link

Implement Shelf::insertBestFit in O(n log n) #7

Open ArxSnow opened 9 years ago

ArxSnow commented 9 years ago

Implement our Best Fit bin packing algorithm to operate in O(n log n).

slbelden commented 9 years ago

We think this should be the easier of the two algorithms. You can use a regular binary search tree. http://acm.zju.edu.cn/dsaa/DS2/P12G05.pdf