What is the maximum number of comparisons needed by binary search on a sorted list of 32 items?
Answer and explanation
Correct answer: C. 6
- Step 1: Each comparison halves the list.
- Step 2: log2(32) + 1 = 6.
Answer
6.
Why not the others: 16, 5 and 8 do not fit.
Practise more Python programming and algorithms.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Python programming and algorithms questions
- What is the output of `print([x**2 for x in range(6) if x % 2 == 0])`?
- What is the output of `print([x**2 for x in range(4) if x % 2 == 0])`?
- What is the output of `print([x**2 for x in range(5) if x % 2 == 0])`?
- What is the output of `print([x**2 for x in range(4) if x % 3 == 0])`?
- What is the output of `print([x**2 for x in range(7) if x % 2 == 0])`?
- What does `'algorithm'[3:4]` return in Python?