[boost] Fwd: [SORT] Parallel Algorithms

Subject: [boost] Fwd: [SORT] Parallel Algorithms
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2015-04-16 04:08:48

Hi Steven

 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 :

   - spreadsort
   - spreadsort_integer
   - spreadsort_float
   - spreadsort_string
   - introsort
   - parallel_introsort
   - smart_merge_sort
   - parallel_stable_sort
   - sample_sort

 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 ?