[Rd] Faster sorting algorithm...
morg@n@em@||box @end|ng |rom gm@||@com
Mon Mar 15 18:04:27 CET 2021
Default method for sort is not radix(especially for character vector). You
might want to read the documentation of sort.
For your second question, I invite you to look at the code of fsort. It is
implemented only for positive finite double, and default to
data.table:::forder ... when the types are different than positive double...
Please read the pdf link I sent, everything is explained in it.
On Mon, 15 Mar 2021, 16:52 Avraham Adler, <avraham.adler using gmail.com> wrote:
> Isn’t the default method now “radix” which is the data.table sort, and
> isn’t that already parallel using openmp where available?
> On Mon, Mar 15, 2021 at 12:26 PM Morgan Morgan <morgan.emailbox using gmail.com>
>> I am not sure if this is the right mailing list, so apologies in advance
>> it is not.
>> I found the following link/presentation:
>> 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
>> [[alternative HTML version deleted]]
>> R-devel using r-project.org mailing list
> Sent from Gmail Mobile
[[alternative HTML version deleted]]
More information about the R-devel