JB> HS>   Have you tried compiling it on an optimising compiler?
JB>   Testing Sort algorithms - this is a 32bit compiler this time.
JB>          5000 items    random  sorted  reversed
JB>          QuickerSort    0.33    0.20     2.93
JB>           rg-qsort()    0.19    0.15     0.16
JB>              qsort()    0.20    0.14     0.15
JB>            SHELLsort    0.83    0.17     0.44
   So, then, one may as well use the standard qsort() and
   not worry too much about it, eh? 
   If you need a faster sort for a specific purpose, you will
   have to test all algorithms in your specific case anyway.
   For general sorting, one may as well just use qsort() and
   save the development time and bother.
> ] This will make no sense whatsoever. Continue (Y/N)?.........
---
---------------