On 3/25/07, Lewis Hyatt <lhyatt@princeton.edu> wrote:
Ok. Here are the results, copied directly from the console:
OK, well a factor of 3 in speed could certainly be interesting. I want to try compiling this code on my system to see how it compares, but I can't seem to compile any of the library now.
I am also getting a lot of errors from radix.hpp, at least some of them are stemming from a typo on line 16.
Also, I wanted to try the multi-key quick sort, but there is no documentation and no example so I have no idea how to use it. At a quick glance, the new mkquicksort.hpp looks to be much cleaner now. (There is an older example, but it doesn't include the mkquicksort.hpp file, it has a bunch of classes defined in the .cpp file containing main).
-Lewis
Ok. I have just re-compiled with gcc and have fixed all of the reported errors. Also, I found a few bugs and have fixed those too. I am posting this working version on vault in the sorting directory with 3 test programs showing radixsort, radix quicksort, and multikey quicksort. Suprisingly, they are all faster than std::sort, mostly by a factor of three and more, for floats, radix sort is faster by a factor of five.