|
|
Binpacking |
|
| Binpacking |
Given m bins of capacity 1, and
n blocks weighing from 0 to 1, fit the blocks into the bins.
|
||
| First-Fit Algorithm |
When presented with a new block, test the bins from left to right, and put the block into the first bin it fits into.
|
||
| Illustration |
|