On Tue, 20 May 2003, The Black Hacker wrote:

> On Tuesday, May 20, 2003, at 17:52 Europe/Rome, Bill Studenmund wrote:
> > If fsck has any algorithms that go faster than O(n), one bigger
> > partition
> s/faster/slower/ ... or "whose complexity grows faster than...", then I
> understand it :)

Fast as in the exponent is bigger. It was a reference to the function, not
the performance of the algorithm.

Take care,

Bill