ACM

Communications of the ACM

Home/Magazine Archive/March 1975 (Vol. 18, No. 3)/Expected time bounds for selection/Abstract

Expected time bounds for selection

By Robert W. Floyd, Ronald L. Rivest
Communications of the ACM, March 1975, Vol. 18 No. 3, Pages 165-172
10.1145/360680.360691
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.