Binary search



binary search
algorithm
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;
(2003-01-14)

Tagged:

Read Also:

  • Binary synchronous transmission

    binary synchronous transmission protocol (Bisynch) An IBM link protocol, developed in the 1960 and popular in the 1970s and 1980s. Binary Synchronous Transmission has been largely replaced in IBM environments with SDLC. Bisync was developed for batch communications between a System 360 computer and the IBM 2780 and 3780 Remote Job Entry (RJE) terminals. It […]

  • Binary tree

    binary tree



  • Binary weapon

    noun a chemical weapon consisting of a projectile containing two substances separately that mix to produce a lethal agent when the projectile is fired

  • Binasal hemianopsia

    binasal hemianopsia



Disclaimer: Binary search definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.