Re: [boost] Integer sorting

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
<boost_at_[hidden]> wrote:
>
> Fenil,
>
> niedz., 20 sty 2019 o 18:22 użytkownik Fenil Mehta via Boost <
> boost_at_[hidden]> napisał:
>
> > [1] 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?
>
> Best,
> Marcin

Hmmm.  Looks like this user is using two different email accounts.
"degski" and "Fenil Mehta".  The answer is in the post from "degski":

> [2] https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/

Still looking through it but looks ingenious.

A