Gate CS-2015-2 Question Paper With Solutions

Q. 11 An unordered list contain n distinct elements. The number of comparisons to find
an element in this list that is neither maximum nor minimum is

(A) Θ(nlogn)

(B) Θ(n)

(C) Θ(logn)

(D) Θ(1)

Answer: (D)

Explanation: