Bin Packing Problem (Minimise number of used Bins)
Pack parcels into trucks, using fewest trucks. Assume all trucks have the same load limit
Algorithms | Big-O Notation |
---|---|
First Fit | O(n) |
First Fit Decreasing | Best case: O(n) , Worst case: O(n log n) |
Best Fit | O(n2) |
Best Fit Decreasing | Best and worst case: O(n2) |