edited by
1,509 views

1 Answer

Best answer
0 votes
0 votes

DAC max min algo = >Using Divide and conquer Finding maximum and minimum in a array.

T(n) = 0            if n=1
         1            if n=2 
         2T(n/2) +2  if n>2 

therefore T(n) = 1.5n - 2 = O(n) 
for 20 element 1.5*20 -2 = 28

               

selected by
Answer:

Related questions

0 votes
0 votes
1 answer
2
Raghav Khajuria asked Oct 13, 2018
322 views
Minimum no of comparisons required to find the minimum and maximum of n distinct elements
1 votes
1 votes
1 answer
3
mystylecse asked Aug 15, 2017
3,449 views
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
89 votes
89 votes
16 answers
4
go_editor asked Sep 28, 2014
53,584 views
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________