The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We prove that an algorithm for selecting both the minimum and maximum element from an unordered set is minimean optimal. This algorithm had already been shown to be minimax optimal. The circumstances in which the same algorithm is optimum for both norms leads to a conjecture relating both norms. The method of proof utilizes a new idea in the theory of sorting optimality, namely degree information of the Hasse digraphs.