binary search

/B AY1 N ER0 IY0 S ER0 CH/
noun
  1. 1

    (computing theory) A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half.

Translate “binary search” into another language