Thumbnail
Access Restriction
Subscribed

Author Franceschini, Gianni ♦ Geffert, Viliam
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2005
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Sorting in-place
Abstract We present the first in-place algorithm for sorting an array of size $\textit{n}$ that performs, in the worst case, at most $\textit{O}(\textit{n}log$ $\textit{n})$ element comparisons and $\textit{O}(\textit{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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 52
Issue Number 4
Page Count 23
Starting Page 515
Ending Page 537


Open content in new tab

   Open content in new tab
Source: ACM Digital Library