Fastest sort algorithm

Shuji Kaya

7 Aug 2020CPOL20 min read

11.7K

321

In-place merge sort on Multi-core and Cache

It is introduction of my original in-place merge sort algorithm. First, considering what is fastest sort from theoretical analysis. Second, explaining my sort program and applying it to cache and multi-core. Third, from measurement, confirming it is top level speed. The conclusion is, my sort can be said the fastest, from cache and multi-core utilization level.

This is an old version of the currently published article.

Only logged in members can view this content

Please go to the GPU Table of Contents to view the list of available articles in this section.

Closed because the post is not clear, or is incomplete and has not been phrased in a way that allows it to be fully understood.. Reported by Afzaal Ahmad Zeeshan, Nelek, OriginalGriff, Richard MacCutchan on Sunday, August 9, 2020 9:22am