The first step performed by the binary search algorithm at each iteration is to:
A) Compare the search key with the lowest element in the current subvector.
B) Compare the search key with the middle element in the current subvector.
C) Compare the search key with the highest element in the current subvector.
D) Count the number of elements in the current subvector.

Question

Quizplus · Accepted Answer

The binary search algorithm divides the search interval in half at each step by comparing the search key with the middle element in the current subvector. This means that choice B is the correct answer as it describes the first step of each iteration.

The First Step Performed by the Binary Search Algorithm at Each