Chapter

Mathematics of Program Construction

Volume 4014 of the series Lecture Notes in Computer Science pp 82-89

Improving Saddleback Search: A Lesson in Algorithm Design

  • Richard S. BirdAffiliated withProgramming Research Group, Oxford University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Over the past twenty-five years or so Saddleback search has been used as an paradigm of how methods of formal program construction can quickly lead to a simple and effective algorithm for searching an ordered table. In this paper we revisit the problem and show that saddleback search is not in fact the best algorithm when one dimension of the table is much smaller than the other. The paper is structured in the form of a classroom discussion involving a teacher and four very clever students.