- #1
zak100
- 462
- 11
- TL;DR Summary
- Hi,
I am trying to read Algorithm book of Allen Weiss which says that FF requires .
Hi,
I am having problem in understanding the following text of the book:
If m = 1 then its possible to have 6 bins.
All1/7 elements would go into 1 bin.
All 6*1/3 items would go into 2 bins
All 6 *1/2 items would go into 3 bins.
Total = 6 bins
It further says:
Somebody please guide me why First Fit would need 10 bins?
Zulfi.
I am having problem in understanding the following text of the book:
My solution:The input consists of 6m items of size 1/7+ Absolon, followed by 6m items of size 1/3+ Absolon , followed by 6m items of size 1/2 + Absolon. One simple packing places one item of each size in a bin and requires 6m bins.
If m = 1 then its possible to have 6 bins.
All1/7 elements would go into 1 bin.
All 6*1/3 items would go into 2 bins
All 6 *1/2 items would go into 3 bins.
Total = 6 bins
It further says:
Why First Fit would require 10 bins? I think First Fit would also require 6 bins.First fit requires 10m bins.
Somebody please guide me why First Fit would need 10 bins?
Zulfi.