1.3.2 Searching
INPUT OUTPUT
Input Description:
A set
S
of
n
keys, a query key
q
.
Problem:
Where is
q
in
S
?
Implementations
LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 7)
Handbook of Algorithms and Data Structures (Pascal) (rating 7)
Moret and Shapiro's Algorithms P to NP (Pascal) (rating 3)
Related Problems
Dictionaries
Sorting
Go to the corresponding chapter in the book
About the Book
Send us Mail
Go to Main Page
This page last modified on Tue Jun 03, 1997
.