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. Cheers, -- Joaquín Cuenca Abela [EMAIL PROTECTED]
- Re: speed results Joaqu�n Cuenca Abela
- Re: speed results Sam TH
- Re: speed results Joaqu�n Cuenca Abela
- Re: speed results Joaqu�n Cuenca Abela
- Re: speed results Hubert Figuiere
- Re: speed results Sam TH
- Re: speed results Sam TH
- Re: speed results Hubert Figuiere
- Re: speed results Paul Rohr
- Re: speed results Joaquin Cuenca Abela
- Re: speed results jskov

