Definitions from Wiktionary (binary search)
▸ noun: (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.
Binary search tree,
Binary search algorithm,
Self-balancing binary search tree,
Optimal binary search tree,
more...
▸ Words similar to binary search
▸ Usage examples for binary search
▸ Idioms related to binary search
▸ Wikipedia articles (New!)
▸ Words that often appear near binary search
▸ Rhymes of binary search
▸ Invented words related to binary search
▸ noun: (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.
Similar:
bucket sort,
selection sort,
bucketsort,
bisection method,
binary arithmetic,
tabu search,
British Museum algorithm,
binary operator,
breadth-first search,
red-black tree,
more...
Opposite:
Phrases:
▸ Words similar to binary search
▸ Usage examples for binary search
▸ Idioms related to binary search
▸ Wikipedia articles (New!)
▸ Words that often appear near binary search
▸ Rhymes of binary search
▸ Invented words related to binary search