An in-place sorting with O ( n log n ) comparisons and O ( n ) moves-Reference-Cited by-同舟云学术

An in-place sorting with O ( n log n ) comparisons and O ( n ) moves

Published:2005-07 Issue:4 Volume:52 Page:515-537
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Franceschini Gianni¹,Geffert Viliam²

Affiliation:

1. University of Pisa, Pisa, Italy

2. P. J. Šafárik University, Košice, Slovakia

Abstract

We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O ( n log n ) element comparisons and O ( n ) element transports.This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/1082036.1082037

Reference18 articles.

1. A Note on HEAPSORT

2. Algorithm 245: Treesort

3. Franceschini G. 2003. An in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves. Tech. rep. Dipartimento di Informatica Università di Pisa. March. (Available from ftp://ftp.di.unipi.it/pub/techreports/TR-03-06.ps.Z.) Franceschini G. 2003. An in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves. Tech. rep. Dipartimento di Informatica Università di Pisa. March. (Available from ftp://ftp.di.unipi.it/pub/techreports/TR-03-06.ps.Z.)

4. Geffert V. 2002. Sorting with O(n log n) comparisons and O(n) transports in-place in the worst case simultaneously. Tech. rep. P. J. Šafárik University. July. (Available from http://ics.upjs.sk/techreports/2002/ultim.ps.) Geffert V. 2002. Sorting with O(n log n) comparisons and O(n) transports in-place in the worst case simultaneously. Tech. rep. P. J. Šafárik University. July. (Available from http://ics.upjs.sk/techreports/2002/ultim.ps.)

5. Geffert V. and Kollár J. 2001. Linear-time in-place selection in ε ˙ n element moves. Tech. rep. P. J. Šafárik University. April. (Available from http://ics.upjs.sk/techreports/2002/select.ps.) Geffert V. and Kollár J. 2001. Linear-time in-place selection in ε ˙ n element moves. Tech. rep. P. J. Šafárik University. April. (Available from http://ics.upjs.sk/techreports/2002/select.ps.)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Engineering In-place (Shared-memory) Sorting Algorithms;ACM Transactions on Parallel Computing;2022-01-31

2. Complexity analysis and performance of double hashing sort algorithm;Journal of the Egyptian Mathematical Society;2019-04-04

3. In-Place Sorting;SOFSEM 2011: Theory and Practice of Computer Science;2011

4. Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection;Computational Geometry;2010-10

5. Multiway in-place merging;Theoretical Computer Science;2010-03