Re: benchmarks - sort

[Schloegl Alois]

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