Handbook of Algorithms and Data Structures
The Handbook of Data Structures and Algorithms, by Gonnet and
Baeza-Yates, provides a comprehensive reference on fundamental
data structures for searching and priority queues, and algorithms for
sorting and text searching.
The book covers these relatively small number of topics
comprehensively, presenting most of the major and minor variations which
appear in the literature.
Perusing the book makes one aware of the tremendous range of data structures
which have been developed, and the intense level of analysis many of them
have been subjected to.
For each data structure or algorithm, a brief description is provided
along with its asymptotic complexity and an extensive set of references.
More distinctively, an implementation in C and/or Pascal is usually
provided, along with experimental results comparing the performance
of these implementations on a variety of distributions.
The authors have created a very slick WWW site for the book,
http://www.dcc.uchile.cl/~rbaeza/handbook/hbook.html,
containing all the source code as well as the index and table of contents.
This entire site has been replicated in the
local distribution site,
although this copy still contains ftp links
to Chile for the algorithm implementations.
However, all of these files are also available
locally.
These files are all
copyrighted
© Addison-Wesley Publishing Co. Inc.
and used with the kind permission of Addison Wesley Longman.
Since many of the elementary data structures and sorting algorithms
can be implemented concisely, most of the programs are very short.
They are perhaps most useful as models, or as part of an experimental
study to compare the performance on different data structures for a
particular application.
Download Files (local site)Ricardo Baeza-Yates's HomepageLink to Handbook of Algorithms and Data StructuresGaston H. Gonnet's Homepage
Problem Links
This page last modified on 2008-07-10
.
www.algorist.com
