## Min & Max in an @rr@y

You have given an array. Find the maximum and minimum numbers in less number of comparisons.

Note : Its is quite simple for all to find in 2*n comparisons can u do it in less than 2*n comparisons?

**Solution**

Only 3n/2 comparisons are necessary to find both the minimum and the maximum. To do this, we maintain the minimum and maximum elements seen thus far. Rather than processing each element of the input by comparing it against the current minimum and maximum, however, at a cost of two comparisons per element, we process elements in pairs. We compare pairs of elements from the input first with each other, and then compare the smaller to the current minimum and the larger to the current maximum, so we need only three comparisons for every two elements and not four.