Go backward to 3.17 Generic Divide-and-Conquer Sorting Algorithm
Go up to 3 An Example of Concept Webs: Programming Concepts
Go forward to 3.19 Some Areas for Expansion of this Concept Web
3.18 Generic Binary Search
A generic binary search is a generic search
algorithm that is also a
generic divide-and-conquer
algorithm, in which the
input is divided into two equal (or equal as possible) parts in the
divide step.
musser@cs.rpi.edu