When searching within the list Lewis,Maurice,Nathan,Oliver,Pat,Quincy,Roger,Stan,Tom
Which of the following entries will be found most quickly using the binary search algorithm?
A) Lewis
B) Pat
C) Tom

Question

Quizplus · Accepted Answer

Binary search algorithm works most efficiently by repeatedly dividing the search interval in half. The middle element of the sorted list (in this case, "Pat") can be found most quickly because the algorithm will start the search from the middle of the list.

When Searching Within the List Lewis,Maurice,Nathan,Oliver,Pat,Quincy,Roger,Stan,Tom