An Improvement on Tree Selection Sort

Authors:
Jingchao Chen
Affiliations:
-
Venue:
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Year:
2002

Citing 11
Cited 0

A variant of Heapsort with almost optimal number of comparisons

Information Processing Letters
Building heaps fast

Journal of Algorithms
The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n

Information and Computation
The influence of caches on the performance of sorting

Journal of Algorithms
Sorting on Electronic Computer Systems

Journal of the ACM (JACM)
Implementing Quicksort programs

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Algorithm 65: find

Communications of the ACM
Proportion Extend Sort

SIAM Journal on Computing
Proportion split sort

Nordic Journal of Computing
Heaps on Heaps

Proceedings of the 9th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The standard Tree Selection Sort is an efficient sorting algorithm but requires extra storage for n-1 pointers and n items. The goal of this paper is to not only reduce the extra storage of Tree Selection Sort to n bits, but also keep the number of comparisons at nlogn+O(n). The improved algorithm makes at most 3n data movements. The empirical results show that the improved algorithm is efficient. In some cases, say moving one item requires at least 3 assignment operations, the algorithm is the fastest on average among known fast algorithms.