Affiliation:
1. Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee, D-79110 Freiburg
Abstract
With refinements to the
WEAK-HEAPSORT
algorithm we establish the general and practical relevant sequential sorting algorithm
INDEX-WEAK-HEAPSORT
with exactly
n
⌈log
n
⌉ - 2
⌈log
n
⌉
+ 1 ≤
n
log
n
-0.9
n
comparisons and at most
n
log
n
+ 0.1
n
transpositions on any given input. It comprises an integer array of size
n
and is best used to generate an index for the data set. With
RELAXED-WEAK-HEAPSORT
and
GREEDY-WEAK-HEAPSORT
we discuss modifications for a smaller set of pending element transpositions.If extra space to create an index is not available, with
QUICK-WEAK-HEAPSORT
we propose an efficient
QUICKSORT
variant with
n
log
n
+ 0.2
n
+
o(n)
comparisons on the average. Furthermore, we present data showing that
WEAK-HEAPSORT, INDEX-WEAK-HEAPSORT
and
QUICK-WEAK-HEAPSORT
compete with other performant
QUICKSORT
and
HEAPSORT
variants.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference31 articles.
1. Lecture Notes in Computer Science (2000);CANTONE D.
2. An average case analysis of Floyd's algorithm to construct heaps
3. DUTTON R.D. 1992. The weak-heap data structure. Technical report University of Central Florida Orlando FL 32816.]] DUTTON R.D. 1992. The weak-heap data structure. Technical report University of Central Florida Orlando FL 32816.]]
4. Weak-heap sort
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献