Re: benchmarks - sort

[Schloegl Alois]

Zitat von Paul Kienzle <address@hidden>:

>
> Paul Thomas pointed me to these benchmarks.  Anybody want to do
> something about them?
>
>       http://www.sciviews.org/other/benchmark.htm
>

...

>
> I.C Matlab 0.89  - Octave 7.77
>      b = sort(a);
>
> Octave's sort is surprisingly slow.  3x worse than any other package
> mentioned.  Anyone know a fast stable sort algorithm?
>


One reason, for the bad performance of the sort algorithm might be the exception
handling of NaNs. See also
http://www.octave.org/octave-lists/archive/bug-octave.2001/msg00047.html

Sorting on the binary level might be helpful, because the bit patterns of the
IEEE754 numbers provide the correct sorting order. This is
-inf < -1 < 0 < 1 < inf < NaN

Just my few thougths.


Alois