Analyzing Multi-Phase Searching Algorithms

Document Type

Article - Open Access

Publication Title

SIGCSE Bulletin


Association for Computing Machinery

Publication Date


Abstract/ Summary

This paper presents a family of multi-phase searching algorithms that can enrich the discussion of searching algorithms in courses like CS 13 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 logarithms.