Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary of n elements. Which one of the following choices is correct?

Question

McqOptions · Accepted Answer

$t > \left\lceil {{{\log }_2}(n)} \right\rceil $ and t ≤ n

McqOptions · Answer

t > 2n - 2

McqOptions · Answer

$t > 3\left\lceil {\frac{n}{2}} \right\rceil $ and t ≤ 2n - 2

McqOptions · Answer

t > n and $t \le 3\left\lceil {\frac{n}{2}} \right\rceil $

1.	Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary of n elements. Which one of the following choices is correct?
A.	t > 2n - 2
B.	\(t > 3\left\lceil {\frac{n}{2}} \right\rceil \) and t ≤ 2n - 2
C.	t > n and \(t \le 3\left\lceil {\frac{n}{2}} \right\rceil \)
D.	\(t > \left\lceil {{{\log }_2}(n)} \right\rceil \) and t ≤ n
Answer» D. \(t > \left\lceil {{{\log }_2}(n)} \right\rceil \) and t ≤ n

Explore topic-wise MCQs in Data Structures and Algorithms.

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary of n elements. Which one of the following choices is correct?