Abstract
The first revision of this third volume is the most comprehensive survey of
classical computer techniques for sorting and searching. It extends the
treatment of data structures in Volume 1 to consider both large and small
databases and internal and external memories. The book contains a selection of
carefully checked computer methods, with a quantitative analysis of their
efficiency. Outstanding features of the second edition include a revised
section on optimum sorting and new discussions of the theory of permutations
and of universal hashing.
Users
Please
log in to take part in the discussion (add own reviews or comments).