A Sorting Problem and Its Complexity 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. CACM June, 1972 Pohl, I. sorting, computational complexity, computational combinatorics 5.29 5.31 CA720608 JB January 30, 1978 4:15 PM 2337 5 2337 2337 5 2337 2337 5 2337