Thumbnail
Access Restriction
Subscribed

Author Rivest, Ronald L. ♦ Floyd, Robert W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Medians ♦ Quantiles ♦ Selection ♦ Tournaments ♦ Computational complexity
Abstract A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n + min(i,n-i) + o(n). A lower bound within 9 percent of the above formula is also derived.
Description Affiliation: Stanford Univ., Stanford, CA (Floyd, Robert W.; Rivest, Ronald L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 3
Page Count 8
Starting Page 165
Ending Page 172


Open content in new tab

   Open content in new tab
Source: ACM Digital Library