Subject: Re: [boost] Integer sorting
From: Jack Adrian Zappa (adrianh.bsc_at_[hidden])
Date: 2019-01-20 18:28:45
On Sun, Jan 20, 2019 at 1:13 PM Marcin Copik via Boost
> niedz., 20 sty 2019 o 18:22 uÅ¼ytkownik Fenil Mehta via Boost <
> boost_at_[hidden]> napisaÅ:
> >  GitHub link: https://github.com/fenilgmehta/Fastest-Integer-Sort
> Would you care to explain how you algorithm sorts in a linear number of
> comparisons as you claim in the repository description? Isn't it the case
> that you have to perform at least O(n * logn) comparisons?
Hmmm. Looks like this user is using two different email accounts.
"degski" and "Fenil Mehta". The answer is in the post from "degski":
>  https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/
Still looking through it but looks ingenious.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk