An In-Place Sorting with O(n log n) Comparisons and O(n) Moves

Authors:
Gianni Franceschini;Viliam Geffert
Affiliations:
-;-
Venue:
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Year:
2003

Citing 0
Cited 8

Navigation piles with applications to sorting, priority queues, and priority deques

Nordic Journal of Computing
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Towards in-place geometric algorithms and data structures

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
In-place 2-d nearest neighbor search

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the adaptiveness of Quicksort

Journal of Experimental Algorithmics (JEA)
Engineering the divide-and-conquer closest pair algorithm

Journal of Computer Science and Technology
Optimal in-place sorting of vectors and records

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Sorting stably, in-place, with O(n log n) comparisons and O(n) moves

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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, e.g., in [J. I. Munro and V. Raman, Sorting with minimum data movement, J. Algorithms, 13, 374-93, 1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously.