In-place sorting

Authors:
Viliam Geffert;Jozef Gajdoš
Affiliations:
Department of Computer Science, P. J. Šafárik University, Košice, Slovakia;College of International Business ISM Slovakia in Prešov, Prešov, Slovakia
Venue:
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Year:
2011

Citing 7
Cited 0

Sorting with minimum data movement

Journal of Algorithms
Selection from read-only memory and sorting with minimum data movement

Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Maintaining dense sequential files in a dynamic environment (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An in-place sorting with O(nlog n) comparisons and O(n) moves

Journal of the ACM (JACM)
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for asymptotically efficient sorting. Our algorithm sorts the given array A by the use of nċ lg n + O(nċlg lg n) comparisons and O(n) element moves. Moreover, this algorithm works in-place, using only a constant auxiliary workspace. This shrinks the gap between the known information-theoretic lower bound and the existing algorithms to O(nċlg lg n) comparisons, even if we require the algorithm to use only a constant auxiliary memory and a linear number of moves.