Data Structures & Their Algorithms

Front Cover
HarperCollins Publishers, 1991 - Computers - 509 pages

Using 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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Problems
36
References
44
Algorithm Paradigms
59
Copyright

20 other sections not shown

Common terms and phrases

About the author (1991)

Harry Lewis, Gordon McKay Professor of Computer Science and Harvard College professor, has been on the Harvard faculty for thirty-two years. He was Dean of Harvard College between 1995 and 2003 and chaired the College's student disciplinary and athletic policy committees. He has been a member of the undergraduate admissions and scholarship committee for more than three decades. Lewis lives in Brookline, Massachusetts.

Bibliographic information