Hello, Laurent, Vladimir!
I created a pull request containing my RadixSort implementation:
https://github.com/bourgesl/nearly-optimal-mergesort-code/pull/1
On my machine the results produced by Mergesorts.java are like this:
Runs with individual timing (skips first 10 runs):
adjusted reps: 110 +
Hi,
Do you know if someone has written a complete JMH benchmark suite dedicated
to Arrays.sort() ?
with varying array size (trivial) but also testing lots of data
distributions: (see Vladimir's tests) and possibly all variants (int, long,
double, Object[] )
It could be part of the standard
Dear Vladimir & other Java sort experts,
I made the port of the DPQS 2018.2 code last night to support a secondary
array to be sorted and use preallocation (aux/run for merge sort):
Hi Vladimir,
Thank you for your attention, you are the Sort Master.
Le ven. 9 nov. 2018 à 09:02, Vladimir Yaroslavskiy a
écrit :
> Hi Laurent,
>
> The new version is still under review, there were a lot of suggestions and
> ideas from Doug Lea.
> I needed time to apply and check them. I'm
