Question
Programming and Data Structures Question on Linked Lists
Consider a list [−2, 0, 3, 5, 9, 11, 13]. Apply binary search to find element -2. Determine the number of key comparison required?
A
2
B
3
C
4
D
1
Answer
3
Explanation
Solution
The correct option is(B):3