Remark on “Algorithm 489: The Algorithm SELECT—for Finding the i th Smallest of n Elements [M1]”

Publisher Website

1 September 1976

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software

Vol. 2 (3), 301-304
https://doi.org/10.1145/355694.355704

Abstract

No abstract available

This publication has 5 references indexed in Scilit:

Expected time bounds for selection
Communications of the ACM, 1975
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM, 1970
A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
The Computer Journal, 1966
Algorithm 63: partition
Communications of the ACM, 1961
An Automatic Method for Finding the Greatest or Least Value of a Function
The Computer Journal, 1960

Cited by 3 articles