Re: [boost] [SORT] Parallel Algorithms

-----Original Message----- From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of Rob Stewart Sent: 25 March 2015 08:43 To: boost@lists.boost.org Subject: Re: [boost] [SORT] Parallel Algorithms

On March 24, 2015 10:32:35 PM EDT, Steven Ross wrote:

...

...

TimSort -> 2M

[snip]

...

Timsort seems fairly impressive, but specialized and already available for free, hence not necessary to include in the library.

While "specialized" may be sufficient grounds to avoid including Timsort, its availability elsewhere for free is not a good justification for excluding it from Boost.

Providing a single source of good, varied algorithms, with equivalent documentation including comparative information to help users choose among the options would seem more than ample reason to include an algorithm.

+1 Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830