In a binary search of an ascending order list, where does the search algorithm begin the search?
A) the beginning of the list
B) a random spot in the list
C) the end of the list
D) the middle of the list

Question

Quizplus · Accepted Answer

The binary search algorithm begins its search at the middle of the list, splitting the list in half each time until the target value is found or determined to be not in the list. This is more efficient than starting at the beginning or end of the list. Starting at a random spot in the list would not guarantee an efficient search and could potentially take longer to find the target value.

In a Binary Search of an Ascending Order List, Where