Binary Search
/ˈbaɪnəri sɜːtʃ/
Definition
An O(log n) search algorithm halving the search space each step, requiring a sorted collection.
Example in context
"Binary search finds the target in a sorted 1,000,000 element array in at most 20 comparisons — O(log n)."
Practice this term
Master Binary Search in context by working through exercises in the Data Structures & Algorithms module. You'll see the term used in real engineering scenarios with multiple-choice, fill-in-the-blank, and matching drills.