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

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

2003-05-09

arxiv.org/abs/cs/0305005v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An In-Place Sorting with O(n log n) Comparisons and O(n) Moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An In-Place Sorting with O(n log n) Comparisons and O(n) Moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719545