Lewis H.R., Denenberg L. Data Structures and Their Algorithms

Addison-Wesley, 1991. – 524 p. – ISBN: 067339736X, 9780673397362Using only practically useful techniques, this book teaches methods for organizing, reorganizing, exploring, and retrieving data in digital computers, and the mathematical analysis of those techniques. The authors present analyses that are relatively brief and non-technical but illuminate the important performance characteristics of the algorithms. Data Structures and Their Algorithms covers algorithms, not the expression of algorithms in the syntax of particular programming languages. The authors have adopted a pseudocode notation that is readily understandable to programmers but has a simple syntax.
This book in an all-inclusive presentation introduces the datastructures (and their algorithms) that comprise the foundationof software engineering. Designed to show students at the sophomorelevel the connection between a programming approach and mathematicaltheory, the text focuses on practical techniques for studentsto master data structures and efficient algorithm implementation.Other topics pertinent to programmers also receive coverage. Chapter-endingproblems and references give students a helpful review and solidifychapter concepts.