Binary search requires that the array
- A
Contain unique values only
- B
Use primitive int values, not Integer objects
- C
Have an even number of elements
- Dcheck_circle
Be sorted in the order being searched
Explanation
Binary search relies on the monotonic ordering invariant. Without sortedness, it cannot prune halves correctly.