What is the maximum number of comparisons binary search needs to find an item in a sorted list of 1,000 items?

  1. 100
  2. 1000
  3. 500
  4. 10
Answer

D) 10

Each step halves the list: 2^10 = 1024 ge 1000, so at most 10 comparisons. SLO CS-11-B-02 · Application

Computer Science MCQ · More Unit 2: Computational Thinking and Algorithms MCQs · Practise