Clifford A. Shaffer, Virginia Polytechnic Institute & State University

Published August, 1996 by Prentice Hall Engineering/Science/Mathematics

Copyright 1997, 494 pp.
Cloth
ISBN 0-13-190752-2
$63.00

Sign up for future
mailings on this subject.

See other books about:
    Data Structures

This practical book is designed for the needs of practicing programmers by presenting the most commonly used data structures, including implementation in C++. It also compares alternatives for practical use. The book also discusses how to perform empirical comparison of algorithms and data structures as well as fundamental disk processing techniques, such as external sorting and B-trees.

Written for users of C++, this book provides integrated treatment of both in-memory and disk-based algorithm techniques to allow readers to see how these techniques are related, and the key differences between them. It presents basic analysis terminology and analysis techniques throughout. The techniques provided assume a range of instructional levels so that they may be used by readers with varying backgrounds in the subject. Other topics include clear explanations and illustrations for most fundamental data structures and algorithms; actual C++ code for nearly all algorithms; the latest data structures; and an introduction to computability and NP-completeness. practicing programmers.



I. PRELIMINARIES.

1. Data Structures and Algorithms.
2. Mathematical Preliminaries.
3. Algorithm Analysis.