Question Details

Consider an unordered list of N distinct integers. What is the minimum num ber of element comparisons required to find an integer in the list that is NOT the largest in the list?

Options

A

1

B

N 1

C

N

D

2N– 1

Show Answer
Correct Answer
A 1

Solution :

The correct option is 1.

To understand why this is the correct answer, let us break down the logical reasoning step-by-step:
We are given an unordered list containing N distinct integers. We assume N≥2 so that there is at least one element that is not the largest.
Since all the integers in the list are distinct, there is exactly one unique largest integer in the entire list. The remaining N-1 integers in the list are strictly smaller than this maximum value, meaning any of them is "NOT the largest".

Now, let us select any two arbitrary elements from the list, say A and B .
If we perform a single comparison between these two elements, we will find one of the following:
1. If A<B , then A is strictly smaller than B . Because B is greater than A , A cannot possibly be the largest element in the entire list.
2. If A>B , then B is strictly smaller than A . Because A is greater than B , B cannot possibly be the largest element in the entire list.

In either case, a single comparison between any two elements allows us to immediately identify one element (the smaller of the two) that is guaranteed not to be the largest element in the list. Therefore, the minimum number of element comparisons required is exactly 1.

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • GATE
  • beginner
  • 3 hours
  • computer science and information technology

Prepare effectively for GATE 2026 Computer Science & Information Technology (CS & IT) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Data Structures, Algorithms, Operating Systems, DBMS, Computer Networks, Theory of Computation, Compiler Design, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 preparation strategy.

  • GATE
  • intermediate
  • 3 hours
  • computer science and information technology

Prepare for GATE 2026 Electrical Engineering (EE) with high-quality study material, previous year question papers, mock tests, syllabus updates, exam pattern, and expert preparation strategies. Master core EE subjects including Power Systems, Control Systems, Electrical Machines, Circuit Theory, Signals & Systems, Power Electronics, and Measurements to secure a top rank in GATE 2026.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: