Subject: Re: speed results
From: Sam TH (sam@uchicago.edu)
Date: Fri Apr 13 2001 - 21:40:33 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.
>
How would we do better than O(n), where n is the number of words? It
can't get faster, the more words we add. But I agree that O(n**2.5)
is bad.
sam th --- sam@uchicago.edu --- http://www.abisource.com/~sam/
OpenPGP Key: CABD33FC --- http://samth.dyndns.org/key
DeCSS: http://samth.dyndns.org/decss
This archive was generated by hypermail 2b25 : Fri Apr 13 2001 - 21:29:22 CDT