10 Nov
2014
10 Nov
'14
7:54 a.m.
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:
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++.