Analyzing multi-phase searching algorithms

  • Authors:
  • Michael J. Bradley

  • Affiliations:
  • Merrimack College, North Andover, MA

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 logarithms. They have many practical applications and they appeal to students.