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

A. θ(n log n)

B. θ(n)

C. θ(log n)

D. θ(1)

D. θ(1)

Ans Θ(1), because all elements are distinct, select any three numbers and output 2nd largest from them.

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