In the binary search program, each time through the list, we cut the list approximately
A) in thirds
B) in quarters
C) by one element
D) in half

Name: In the binary search program, each time through the list, we cut the list approximately A) in thirds B) in quarters C) by one element D) in half
Brand: Quizplus
Rating: 4.8 (39 reviews)

Question

Quizplus · Accepted Answer

Binary search works by continuously dividing the search interval in half. This is the most efficient way to locate the target element in a sorted list.

In the Binary Search Program, Each Time Through the List