binary search

About 0.47 uses per million words.

Meaning

1. noun 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.

Similar words

bucket sort selection sort bucketsort bisection method binary arithmetic tabu search british museum algorithm binary operator breadth-first search red-black tree