• retagged by
1,755 views
2 2 votes
The minimum number of comparisons required to find the minimum and the maximum of 101 numbers is ________.

When n is even then it's relatively easy, but how to deal with n is odd?

My answer is 150 comparisons.

2 Answers

Answer:
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
2.3k
2.3k views
Siddhi Viradiya asked Apr 3, 2016
2,299 views
i cannot understand the following explanation..how solution is (3/2)n-2???If n is a power of 2, then we can write T(n) as:T(n) = 2T(n/2) + 2After solving above recursion,...
1 1 vote
1 answers 1 answer
4.1k
4.1k views
mystylecse asked Aug 15, 2017
4,147 views
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
2 2 votes
1 answers 1 answer
2.4k
2.4k views
Payal Rastogi asked Nov 15, 2015
2,361 views
30. The number of comparisons that are necessary and sufficient for finding both the largest and smallest elements in a set of ' $n$ ' elements is$(3 n / 2)-2$$2 \mathrm{...
1 1 vote
1 1 answer
1.4k
1.4k views
Rajesh R asked Nov 9, 2017
1,424 views
Atmost how many comparisons are required to find out min and max in an array of n elements where n is even ?Answer is atmost 1.5n - 2 comparisons.For n=6, I tried manuall...