binary search

Computing Dictionary

binary search definition

A search algorithm which repeatedly divides an ordered search space in half according to how the required (key) value compares with the middle element.
The following pseudo-C routine performs a binary search return the index of the element of vector "thing[first..last]" equal to "target":
if (target thing[last]) return NOT_FOUND; while (first mid = (first+last)/2; /* truncate to integer */ if (target == thing[mid]) return mid; if (target if (target == thing[last]) return last; return NOT_FOUND;
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: binary pulsar
Next Definition: binary star
Words Near: binary search
More from
Synonyms and Antonyms for binary search
More from
Search for articles containing binary search
More from Translator Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature