Data Structures and Algorithm Analysis

Front Cover
Benjamin/Cummings Publishing Company, 1995 - Computers - 507 pages
This revision of Weiss' best-seller provides a concise, complete and dynamic picture of many important data structures used in modern programming practice using Pascal. The new edition retains its focus on issues of performances and efficiency, with the emphasis on concepts rather than code.*Many new and innovative data structures have been added including Tries/patricia, k-d trees, min max heaps, red black trees and pairing heaps *Many diagrams and illustrations added to aid the reader's understanding of data structures

From inside the book

What people are saying - Write a review

LibraryThing Review

User Review  - sloDavid - LibraryThing

Wow. This book really blew my mind. Has excellent chapters on trees, hashing and sorting. Still relevant, even in 2005. The concepts are useful regardless of the programming language--Weiss simply uses JAVA to implement the concepts. Read full review

LibraryThing Review

User Review  - lovesasha - LibraryThing

I read this book when I want to fall asleep. Sure, it's technically good information, but it's also mind-numbingly boring. Read full review


Algorithm Analysis
Lists Stacks and Queues

10 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1995)

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.


Bibliographic information