Analyzing multi-phase searching algorithms

@inproceedings{Bradley1996AnalyzingMS,
  title={Analyzing multi-phase searching algorithms},
  author={Michael Joshua Bradley},
  booktitle={SGCS},
  year={1996}
}
This paper presents a family of multi-phase searching algorithms that can enrich the discussion of searching algorithms in courses like CS13 Algorithms or CS7 Data Structures and Algorithm Analysis. These algorithms exhibit a natural but subtle relationship between the sequential search and binary search algorithms. They are non-trivial algorithms, yet they are easy to understand. Their complexity analysis is accessible, making use of differential calculus, Lagrange multipliers and base-2… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…