DiskOnChip write performance

[Ollie Lho]

David Woodhouse wrote:
> 
> ollie at sis.com.tw said:
> > > Don't forget "don't use O(n^3) algorithms when trying to find a new
> > > block to write to".
> 
> > What does this suppose to mean ??
> 
> Algorithms which take time proportional to the cube of 'n', where n is some
> variable indicating the complexity of the task - in this case it would be
> the number of blocks on the DiskOnChip which are to be considered for
> selection.
> 

Yea, I know what Big O is although I am not CompSci graduate. My
question
is which part of the NFTL code is that bad ??

Ollie