[Rd] Faster sorting algorithm...

Abby Spurdle @purd|e@@ @end|ng |rom gm@||@com
Tue Mar 16 02:44:14 CET 2021

In principle, I agree that faster ranking/sorting algorithms are
important, and should be a priority.
But I can't help but feel that the paper focuses on textbook-oriented problems.

Given that in real world problems, there's almost always some form of
prior knowledge:
Wouldn't it be better, from a management perspective, to focus on
sorting algorithms, that incorporate that prior knowledge?

I'm not sure whether that's an R-devel discussion, or for another forum...

On Tue, Mar 16, 2021 at 5:25 AM Morgan Morgan <morgan.emailbox using gmail.com> wrote:
> Hi,
> I am not sure if this is the right mailing list, so apologies in advance if
> it is not.
> I found the following link/presentation:
> https://www.r-project.org/dsc/2016/slides/ParallelSort.pdf
> The implementation of fsort is interesting but incomplete (not sure why?)
> and can be improved or made faster (at least 25%  I believe). I might be
> wrong but there are maybe a couple of bugs as well.
> My questions are:
> 1/ Is the R Core team interested in a faster sorting algo? (Multithread or
> even single threaded)
> 2/ I see an issue with the license, which is MPL-2.0, and hence not
> compatible with base R, Python and Julia. Is there an interest to change
> the license of fsort so all 3 languages (and all the people using these
> languages) can benefit from it? (Like suggested on the first page)
> Please let me know if there is an interest to address the above points, I
> would be happy to look into it (free of charge of course!).
> Thank you
> Best regards
> Morgan
>         [[alternative HTML version deleted]]
> ______________________________________________
> R-devel using r-project.org mailing list
> https://stat.ethz.ch/mailman/listinfo/r-devel

More information about the R-devel mailing list