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?
- A1
- B
- C
- D
AlgorithmsSearching, Sorting, Hashing MechanismsMCQ1 mark · −1/3 if wrongEasy
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.