Prev Up Next
Go backward to 3.15 Generic Sorting Algorithm
Go up to 3 An Example of Concept Webs: Programming Concepts
Go forward to 3.17 Generic Divide-and-Conquer Sorting Algorithm

3.16 Generic Search Algorithm

A generic search algorithm is a generic algorithm whose input-output relation is specialized to the relation that the inputs are a collection of values and another value, and the output is the boolean value true if the other value belongs to the collection, false otherwise.

Subconcepts include generic linear search and generic binary search.


musser@cs.rpi.edu

Prev Up Next