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: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 2014-11-10 09:02:49


On 10 November 2014 23:53, Steven Ross <spreadsort_at_[hidden]> wrote:

> > 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.
>
> I'd appreciate if you could point me to specific implementations and/or
> data, so I can run a direct comparison.

You could always compare against my implementation of LSD radix sort:

https://github.com/jeremy-murphy/algorithm/tree/speed_test

It's very 'by the book'.

I haven't really looked at yours or my code for a while but I just posted
my raw speed test results for the purpose of this discussion -- the
formatting didn't work out too well but I hope you'll be able to follow
it. Hope it is of some use.

Cheers.

Jeremy


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