Bottom-up-heat sort, a new variant of heap sort beating an average quick sort
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Communications of the ACM
Communications of the ACM
Algorithms and Data Structures: Design, Correctness, Analysis
Algorithms and Data Structures: Design, Correctness, Analysis
An Improvement on Tree Selection Sort
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Building a new sort function for a C library
Software—Practice & Experience
Efficient sample sort and the average case analysis or PEsort
Theoretical Computer Science
| Hi-index | 0.00 |
This paper introduces a new sorting algorithm called PROPORTION SPLIT SORT. The algorithm splits a sequence into two blocks in the ratio of 1 : p - 1, where p is a fixed constant, then divides them into four blocks with the median of the first block such that the maximum of the left two blocks is less than or equal to the minimum of the right two blocks. Finally, we perform the sorting of the left two blocks and the right two blocks separately. The worst case number of comparisons of this sorting algorithm is bounded by 1/log(2p/(2p - 1))n log n for p 1. In our simulation, when p = 2, the average number is close to n log n - 1.2n, and for some p (e.g. p = 16), this algorithm is faster than CLEVER QUICKSORT which is referred to as the fastest sorting algorithm.