• DOI:10.1145/289251.289255
Corpus ID: 23752485

Analytic derivation of comparisons in binary search

@article{Rolfe1997AnalyticDO,
  title={Analytic derivation of comparisons in binary search},
  author={T. Rolfe},
  journal={ACM Signum Newsletter},
  year={1997},
  volume={32},
  pages={15-19}
}

• T. Rolfe
• Published 1997
• Mathematics
• ACM Signum Newsletter

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed

Numerous authors of programming texts and algorithms / data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes --- the key is to the left of the midpoint, to the right of the midpoint, or exactly at the midpoint --- Implementation A below.