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:

Divided

A mathematical operation where one quantity is evenly distributed into parts or groups.

Algebraic Expression

A combination of variables, numbers, and at least one arithmetic operation, without an equality sign.

Rectangle

A quadrilateral with four right angles and opposite sides that are parallel and equal in length.

Simplified Expression

A mathematical expression that has been reduced to its most basic form, eliminating any unnecessary complexity.