As here the number of numbers in the array is even ..
Using divide and conquer ,
No of comparisons needed to find = 1.5 n - 2
Actually this comes from the recurrence for no of comparisons involved denoted by T(n) :
T(n) = 0 , if n = 1
= 1 , if n = 2
= 2T(n/2) + 2 , otherwise
So here n = 60
Hence no of comparisons needed to find min-max = 1.5 * 60 - 2
= 90 - 2
= 88