A sorting problem and its complexity
- 1 June 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (6), 462-464
- https://doi.org/10.1145/361405.361423
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- Heuristic search viewed as path finding in a graphArtificial Intelligence, 1970