On Thu, 15 Jun 2023 09:21:13 GMT, Laurent Bourgès <lbour...@openjdk.org> wrote:
>> * improved mixed insertion sort (makes whole sorting faster) >> * introduced Radix which sort shows several times boost of performance and >> has linear complexity instead of n*ln(n) >> * improved merging sort for almost sorted data >> * optimized parallel sorting >> * improved step for pivot candidates and pivot partitioning >> * extended existing tests >> * added benchmarking JMH tests >> * suggested better buffer allocation: if no memory, it is switched to >> in-place sorting with no OutOfMemoryError, threshold is 1/16th heap >> >> I am going on previous PR by Vladimir Yaroslavskyi: >> https://github.com/openjdk/jdk/pull/3938 > > Laurent Bourgès has updated the pull request incrementally with two > additional commits since the last revision: > > - Merge branch 'dpqs23' of github.com:bourgesl/jdk-official into dpqs23 > - simplified test to enable radix sort (improved sorting on period and > shuffle data) + updated version to 22 Please @AlanBateman could you review this PR? ------------- PR Comment: https://git.openjdk.org/jdk/pull/13568#issuecomment-1653144787
