Consider an unordered list of 𝑁 distinct integers. What is the minimum number…

PYQ GATE 2025

Consider an unordered list of 𝑁 distinct integers.

What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?

  1. A.

    1

  2. B.

    𝑁 − 1

  3. C.

    𝑁

  4. D.

    2𝑁 − 1

Attempted by 611 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…