In this revision of a leading text, Mark Allen Weiss provides a concise, complete, and dynamic picture of many important data structures used in modern programming practice, with a focus on issues of performance and efficiency. 080539057XB04062001
Auflage
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Maße
Höhe: 242 mm
Breite: 193 mm
Dicke: 25 mm
Gewicht
ISBN-13
978-0-8053-9057-5 (9780805390575)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
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.
080539057XAB04062001
Introduction
Algorithm Analysis.
Lists, Stacks, and Queues.
Trees.
Hashing.
Priority Queues.
Sorting.
The Disjoint Set ADT.
Graph Algorithms.
Algorithm Design Techniques.
Amortized Analysis.
Advanced Data Structures and Implementation.
