This one is a simple algorithm question.
There are ‘n’ numbers. Maximum of the ‘n’ numbers can be found in (n-1) comparisons, similarly minimum can be found in (n-1) comparisons. In total there would be (2n-2) comparisons. Can you find out the maximum & minimum in lesser number of comparisons?