Subject: Re: [boost] [SORT] Parallel Algorithms
From: Paul A. Bristow (pbristow_at_[hidden])
Date: 2015-03-25 06:00:46
> -----Original Message-----
> From: Boost [mailto:boost-bounces_at_[hidden]] On Behalf Of Rob Stewart
> Sent: 25 March 2015 08:43
> To: boost_at_[hidden]
> Subject: Re: [boost] [SORT] Parallel Algorithms
> On March 24, 2015 10:32:35 PM EDT, Steven Ross <spreadsort_at_[hidden]> wrote:
> > > TimSort -> 2M
> > 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
> include an algorithm.
--- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk