Subject: Re: speed results
From: Aaron Lehmann (aaronl@vitelus.com)
Date: Sat Apr 14 2001 - 13:17:52 CDT
On Sat, Apr 14, 2001 at 04:17:35AM +0200, Joaqu?n Cuenca Abela wrote:
> In my tests, the algorithm to write a new word is ~O(n^2.5)
> Attached is a graph showing time(nb of words).
>
> I think that we should aim for 1.0 at (ideally) O(1), or at least
> O(log(n)).
> Worse than that is simply unacceptable.
You rock! :) Finally some real analysis.
This archive was generated by hypermail 2b25 : Sat Apr 14 2001 - 13:18:52 CDT