The Binary Search Algorithm __________

question 50

Multiple Choice

The binary search algorithm __________.

• A) is less efficient than the sequential search algorithm
• B) will cut the portion of the array being searched in half each time it fails to locate the search value
• C) will have a maximum number of comparisons equal to the number of elements in the array
• D) will, normally, have the number of comparisons that is half the number of elements in the array

---

Definitions:

Order of Magnitude

An order of magnitude is a term used to express the scale or size of a quantity, typically in powers of ten, to compare approximate values or changes.

Binary Search Algorithm

An efficient algorithm for finding a target value within a sorted array by repeatedly dividing in half the portion of the list that could contain the target.

Infinite Recursion

A situation in which a function or method calls itself without an exit condition, leading to a stack overflow error.

Base Case

In recursive programming, a condition that stops the recursion by not making any further calls.