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. © 1972, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Pohl, I. (1972). A Sorting Problem and Its Complexity. Communications of the ACM, 15(6), 462–464. https://doi.org/10.1145/361405.361423
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free