Home → Magazine Archive → June 1972 (Vol. 15, No. 6) → A sorting problem and its complexity → Abstract

A sorting problem and its complexity

By Ira Pohl

Communications of the ACM, Vol. 15 No. 6, Pages 462-464
10.1145/361405.361423


Save PDF
A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique.

The full text of this article is premium content

0 Comments

No entries found