Hi Vladimir,
One short comment, see below:
Le jeu. 15 nov. 2018 à 15:39, Vladimir Yaroslavskiy a
écrit :
> Hello, Tagir!
>
> I compared Radix sort with Dual-Pivot Quicksort and see
> that Radix sort is faster than DPQ (on 2M elements) on random data in
> twice times,
> but it works slower on r
Hi all Sorting experts,
I want to let you know I am building a Sorting benchmark suite myself based
on contributions of Sebastian Wild (forked github repo) & Vladimir on
github (MIT license):
https://github.com/bourgesl/nearly-optimal-mergesort-code
I hope to exploit JMH in a short future to obta
Hello, Tagir!
I compared Radix sort with Dual-Pivot Quicksort and see
that Radix sort is faster than DPQ (on 2M elements) on random data in twice
times,
but it works slower on repeated elements (in 3-7 times). For highly
structured arrays merging sort is invoked in both cases. Other
data types -
Hello, Tagir!
Thank you for interesting news! I will look at RadixSort and let you know my
result.
It may happen that int will be sorted by numeric-specific sorting algorithm
(like we switched byte, char, short to counting sort).
Regards,
Vladimir
>Среда, 14 ноября 2018, 19:17 +03:00 от Tagir
Dear Vladimir,
No information about JMH benchmarking.
>
I like it as Alexey made the best framework to benchmark short operations,
like sorting small arrays.
For example, 1000 ints ~ 0.05ms on my i7 laptop at fixed freq = 2ghz.
I use Bentley's test suite to compare algorithms.
>
Is it publicly
Hi Laurent,
No information about JMH benchmarking.
I use Bentley's test suite to compare algorithms.
>Понедельник, 12 ноября 2018, 13:06 +03:00 от Laurent Bourgès
>:
>
>Hi,
>
>Do you know if someone has written a complete JMH benchmark suite dedicated to
>Arrays.sort() ?
>with varying array si
