The ____ search is faster when searching an array of elements for a target element.
A) bubble
B) linear
C) binary
D) selection

Question

Quizplus · Accepted Answer

The binary search algorithm is faster when searching an array of elements for a target element because it divides the array into smaller parts and checks if the target element is in the left or right half of the array. This process is repeated until the target element is found or it is determined it does not exist in the array. This approach is more efficient than linear search or other algorithms.

The ____ Search Is Faster When Searching an Array of Elements