Analytic derivation of comparisons in binary search

  title={Analytic derivation of comparisons in binary search},
  author={T. Rolfe},
  journal={ACM Signum Newsletter},
  • T. Rolfe
  • Published 1997
  • Mathematics
  • ACM Signum Newsletter
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. 
3 Citations

Figures from this paper

Quantifying the parallelism in BPMN processes using model checking
  • 11
  • PDF