retagged by
1,127 views

1 Answer

Best answer
3 votes
3 votes

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 

selected by
Answer:

Related questions

3 votes
3 votes
1 answer
1
sushmita asked Mar 23, 2017
2,633 views
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER??RECURRENCE RELATION IS$ T(n) = 2 T(\frac{n}{2}) + 2 $IT SHOULD ...
0 votes
0 votes
1 answer
2
Aspi R Osa asked Dec 14, 2015
1,509 views
Consider a set of 20 elements.To find maximum and minimum element in the given set, the minimum number of comparisons required is _________? (using DAC Max-Min algorithm)...
1 votes
1 votes
1 answer
3