The minimum and maximum in an array of size n can be found

Question

The minimum and maximum in an array of size n can be found using (3/2)n comparisons instead of 2ⁿ comparisons by considering the elements in pairs and comparing the larger element of the pair against the current maximum and the smaller element of the pair against the current minimum. Implement this algorithm.