Back to Search Start Over

A Sorting Problem and Its Complexity.

Authors :
Pohl, Ira
Morris, R.
Source :
Communications of the ACM. Jun72, Vol. 15 Issue 6, p462-464. 3p.
Publication Year :
1972

Abstract

A technique for proving ruin-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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*COMPUTER algorithms
*ALGORITHMS
*COMPUTER programming
*COMPUTER science
*COMPUTER systems
*COMPUTATIONAL complexity

Details

Language :
English
ISSN :
00010782
Volume :
15
Issue :
6
Database :
Academic Search Index
Journal :
Communications of the ACM
Publication Type :
Periodical
Accession number :
5221639
Full Text :
https://doi.org/10.1145/361405.361423
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details