(computingtheory) A search for a value within a sortedarray by repeatedly comparing the target value with the middleelement; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half.