 #1
zak100
 462
 11
 TL;DR Summary

Hi,
I am trying to understand the running time of FF algorithm
Hi,
I am trying to understand the running time of FF both the original and improved version. For the original version book says:
What I understand from this that before placing the items, FF traverses all the bins from beginning to end i.e. n bins.
Now each bin can have n items, because of that the running time is O(n^2)
Kindly guide me is my understanding correct.
Zulfi.
I am trying to understand the running time of FF both the original and improved version. For the original version book says:
A simple method of implementing first fit would process each item by scanning down the list of bins sequentially. This would take O(n^2).
What I understand from this that before placing the items, FF traverses all the bins from beginning to end i.e. n bins.
Now each bin can have n items, because of that the running time is O(n^2)
Kindly guide me is my understanding correct.
Zulfi.