This paper introduces a new family of in-place sorting algorithms, the partition sorts. They are appealing both for their relative simplicity and their efficient performance. They perform ⊖(n log n) operations on the average, and G(n log2n) operations in the worst case. The partition sorts are related to another family of sorting algorithms discovered recently by Chen [Che02]. He showed empirically that one version ran faster, on the average, than quicksort, and that the algorithm family performed ⊖(n log n) comparisons in the worst case; however no average case analysis was obtained. This paper completes the analysis of Chen's algorithm family. In particular, a bound of n log n + ⊖(n) comparisons and ⊖(n log n) operations is shown for the average case, and ⊖(n log2n) operations for the worst case. The average case analysis is somewhat unusual. It proceeds by showing that Chen's sorts perform, on the average, no more comparisons than the partition sorts. Optimised versions of the partition sort and Chen's algorithm are very similar in performance, and both run marginally faster than an optimised quasi-best-of-nine variant of quicksort [BM93]. They both have a markedly smaller variance than the quicksorts.
|Original language||English (US)|
|Number of pages||12|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)