|
Boost : |
Subject: Re: [boost] Integer sorting
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2019-01-21 08:28:39
Hi Fenil,
I am Francisco Tapia, one of the maintainers of the Sort Library.
I had been watching your code, and find it interesting. But give me a week
to say you something. These days I am very busy, and I expect to have time
the next weekend, and examine and test your code.
Yours
Francisco Tapia
El lun., 21 ene. 2019 a las 8:41, Richard Hodges via Boost (<
boost_at_[hidden]>) escribió:
> On Sat, 29 Dec 2018 at 03:36, Fenil Mehta via Boost <boost_at_[hidden]
> >
> wrote:
>
> > I have written a sorting algorithm which is way faster than std::sort for
> > all array size.
>
>
> "Extraordinary claims require extraordinary evidence" - Carl Sagan
>
> https://en.wikipedia.org/wiki/Sagan_standard
>
>
>
>
> > The link is as follows:
> > https://github.com/fenilgmehta/Fastest-Integer-Sort
> >
> > Some guidance would be appreciated on how to improve the project
> structure
> > and the steps to get it included in boost.
> >
> > Regards,
> > Fenil Mehta
> >
> > _______________________________________________
> > Unsubscribe & other changes:
> > http://lists.boost.org/mailman/listinfo.cgi/boost
> >
>
>
> --
> Richard Hodges
> hodges.r_at_[hidden]
> office: +442032898513
> home: +376841522
> mobile: +376380212 (this will be *expensive* outside Andorra!)
> skype: madmongo
> facebook: hodges.r
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk