binary search

Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search



binary search (countable and uncountable, plural binary searches)

  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.