GATE CS 2015 Set 2 – Question 14

Multiple choice 1 mark Question 14 2015

Question 14

MCQ 1 marks · −0.33 Algorithms

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 \(\Theta(n \log n)\) B \(\Theta(n)\) C \(\Theta(\log n)\) D \(\Theta(1)\)

Answers and explanations are free — they just need an account.

GATE CS — Computer Science & IT 2015 Algorithms

Source: GATE 2015 Computer Science and Information Technology, Set 2, Q14 (set and question number approximate)