Q2

MCQ1 mark, −0.33

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 array of $n$ elements. Which one of the following choices is correct?

(A)

$t>2n-2$

(B)

$t>3\lceil \frac{n}{2}\rceil \text{ and } t\leq 2n-2$

(C)

$t>n \text{ and } t\leq 3\lceil \frac{n}{2}\rceil$

(D)

$t>\lceil \log_2(n)\rceil \text{ and } t\leq n$

Loading…