Subject: [boost] Fwd: [SORT] Parallel Algorithms
From: Francisco JosÃ© Tapia (fjtapia_at_[hidden])
Date: 2015-04-16 04:08:48
I had been revising and testing spreadsort, and the results are impressive.
I have prepared the benchmarks and include spreadsort. Now the numbers are
extracted from a file generated with a random number generator. In a few
days I will put all in a git repository for a easy access
As I had seen, you use boost::sort for to invoke to spreadsort. If you use
this name, which name use for to invoke introsort?
I think a good idea can be call the algorithms by their name. If we do
this we have the next algorithm list :
I think it's a simple and easy to understand, because with the name sort,
many people think about an algorithm as introsort ( general , not specific
for several data types) and not stable.
What's your opinion ?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk