Pushing the Limits in Sequential Sorting

Authors:
Stefan Edelkamp;Patrick Stiegeler
Affiliations:
-;-
Venue:
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Year:
2000

Citing 10
Cited 0

An average case analysis of Floyd's algorithm to construct heaps

Information and Control
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Building heaps fast

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
Increasing the efficiency of quicksort

Communications of the ACM
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
On the Performance of WEAK-HEAPSORT

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Performance Engineering Case Study: Heap Construction

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

With refinements to the WEAK-HEAPSORT algorithm we establish the general and practical relevant sequential sorting algorithm RELAXED-WEAK-HEAPSORT executing exactly n⌈log n⌉ - 2⌈log n⌉ + 1 ≤ n log n - 0.9n comparisons on any given input. The number of transpositions is bounded by n plus the number of comparisons. Experiments show that RELAXED-WEAK-HEAPSORT only requires O(n) extra bits. Even if this space is not available, with QUICK-WEAK-HEAPSORT we propose an efficient QUICKSORT variant with n log n+0.2n+ o(n) comparisons on the average. Furthermore, we present data showing that WEAK-HEAPSORT, RELAXED-WEAK-HEAPSORT and QUICK-WEAK-HEAPSORT beat other performant QUICKSORT and HEAPSORT variants even for moderate values of n.