From octave-maintainers-request at bevo dot che dot wisc dot edu Sat Jan 17 19:28:19 2004
Subject: Re: benchmarks - sort
From: Schloegl Alois <alois dot schloegl at tugraz dot at>
To: David Bateman <David dot Bateman at motorola dot com>
Cc: Paul Kienzle <pkienzle at users dot sourceforge dot net>,    octave-maintainers@bevo.che.wisc.edu
Date: Sun, 18 Jan 2004 02:28:12 +0100



My previous mail was not ready to go.
Please, ignore  the last sentence, it was not intended.


I wanted to conclude that:
- the algorithm should be of order O(n.log(n))
    here a different algorithm might be needed
- and the comparison operator should be as fast and simple as possible
    here the 2-step approach as outlined in the previous mail could help.



Alois