Boost logo

Boost :

Subject: Re: [boost] [sort] Re: [review] Formal review period for Sort library begins today, November 10, and ends Wednesday, November 19
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2014-11-10 02:54:29


On 10/11/2014 08:35, Vladimir Prus wrote:

> I am not sure the library is useful. For very few users, sorting 100kb
> arrays of integers is a performance
> bottleneck. And if it's truly a performance bottleneck, one would
> probably ponder cache architecture, or use of GPU, or
> a zillion other tricks. Like this paper from 2010 appears to do, for
> example:
>
> http://dl.acm.org/citation.cfm?doid=1807167.1807207

I have personally seen cases where sorting speed is a bottleneck.

However, there are implementations that are still quite faster than this
library (I have one that is at least 3.5 faster than std::sort), and
that fares better with small sizes.

Nevertheless, it would be interesting to have a radix sorting library
implemented in generic C++.


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk