1.1.1 Dictionaries
INPUT OUTPUT
Input Description:
A set of
n
records, each identified by one or more key fields.
Problem:
Build and maintain a data structure to efficiently locate, insert, or delete
the record associated with any query key
q
.
Implementations
LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 10)
Handbook of Algorithms and Data Structures (Pascal) (rating 8)
Xtango and Polka Algorithm Animation Systems (C++) (rating 5)
DIMACS Implementation Challenges (FORTRAN) (rating 1)
Related Problems
Priority Queues
Searching
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
.