Given an ordered array with 15 elements, how many elements must be visited in the worst case of binary search?
A)2
B)8
C)4
D)3

Name: Given an ordered array with 15 elements, how many elements must be visited in the worst case of binary search? A)2 B)8 C)4 D)3
Brand: Quizplus
Rating: 4.8 (36 reviews)

Question

Quizplus · Accepted Answer

In a binary search, the worst-case scenario requires visiting log2(n) elements, where n is the number of elements. For 15 elements, log2(15) is approximately 4. Therefore, 4 elements must be visited in the worst case.

Given an Ordered Array with 15 Elements, How Many Elements