![GATE 2015 [Set-2]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
GATE 2015 [Set-3]
April 3, 2025GATE 2015 [Set-2]
April 4, 2025GATE 2015 [Set-2]
|
Question 11
|
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
|
Θ(nlog n)
|
|
|
Θ(n)
|
|
|
Θ(log n)
|
|
|
Θ(1)
|
Question 11 Explanation:
Consider first three element of the list, atleast one of them will be neither minimum nor maximum.
∴ Θ(1)
∴ Θ(1)
Correct Answer: D
Question 11 Explanation:
Consider first three element of the list, atleast one of them will be neither minimum nor maximum.
∴ Θ(1)
∴ Θ(1)