Analyzing Multi-Phase Searching Algorithms
Article - Open Access
Association for Computing Machinery
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.
Bradley, M. J.
(1996). Analyzing Multi-Phase Searching Algorithms. SIGCSE Bulletin, 28(3), 5-8.
Available at: http://scholarworks.merrimack.edu/mth_facpub/1