What is the minimum number of comparisons required in an array to find the minimum and maximum of 105 integers?

To find the minimum and maximum of 105 integers, we can use the tournament method. In this method, we compare elements in pairs. With each comparison, we can find a smaller and larger element.

Here are the steps:

1. If the number of integers is odd, we initialize the minimum and maximum as the first element. If the number of integers is even, we initialize the minimum and maximum as the smaller and larger of the first two elements respectively. We start from the third element in case of odd count and fourth element in case of even count.

2. For the rest of the elements, pick them in pairs. Compare the larger element with the maximum, and the smaller element with the minimum.

The number of comparisons required in this method is approximately 1.5n, where n is the number of integers.

So, for 105 integers, the minimum number of comparisons required would be approximately 1.5 * 105 = 157.5.

Since we can't have half a comparison, we round up to the nearest whole number.

So, the minimum number of comparisons required to find the minimum and maximum of 105 integers is 158.