PA of Algorithms Q71

0. 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

Answer
Comment
Array

Option : D
Explanation :
Suppose a list contains n elements, consider first three element and find middle element which will be neither maximum nor minimum. Hence it is θ(1).

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.