A sorting problem and its complexity
Ira Pohl · Communications of the ACM · 1972
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.