On the Performance of WEAK-HEAPSORT

Authors:
Stefan Edelkamp;Ingo Wegener
Affiliations:
-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 16
Cited 6

Improved upper bounds on Shellsort

Journal of Computer and System Sciences
A new upper bound for Shellsort

Journal of Algorithms
Building heaps fast

Journal of Algorithms
The analysis of heapsort

Journal of Algorithms
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
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
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
In-place sorting with fewer moves

Information Processing Letters
Increasing the efficiency of quicksort

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
An empirical study of minimal storage sorting

Communications of the ACM
A high-speed sorting procedure

Communications of the ACM
Practical in-place mergesort

Nordic Journal of Computing
Average-Case Complexity of Shellsort

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports

ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Shellsort and sorting networks

Shellsort and sorting networks

Pushing the Limits in Sequential Sorting

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Policy-based benchmarking of weak heaps and their relatives,

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Two constant-factor-optimal realizations of adaptive heapsort

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The weak-heap data structure: Variants and applications

Journal of Discrete Algorithms
The weak-heap family of priority queues in theory and praxis

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Weak heaps engineered

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dutton (1993) presents a further HEAPSORT variant called WEAK-HEAPSORT, which also contains a new data structure for priority queues. The sorting algorithm and the underlying data structure are analyzed showing that WEAK-HEAPSORT is the best HEAPSORT variant and that it has a lot of nice properties. It is shown that the worst case number of comparisons is n⌈log n⌉ - 2⌈log n⌉ + n - ⌈log n⌉ ≤ n log n + 0.1n and weak heaps can be generated with n - 1 comparisons. A double-ended priority queue based on weakheaps can be generated in n + ⌈n/2⌉ - 2 comparisons. Moreover, examples for the worst and the best case of WEAK-HEAPSORT are presented, the number of Weak-Heaps on {1,...,n} is determined, and experiments on the average case are reported.