Résumé
In this second edition of his successful book, experienced
teacher and author Mark Allen Weiss continues to
refine and enhance his innovative approach to algorithms
and data structures. Written for the advanced data
structures course, this text highlights theoretical topics
like abstract data types and the efficiency of algorithms,
as well as performance and running time. This edition also
includes a new chapter on advanced data structures and
material on the Standard Template Library that conforms to
the new standard. In addition, all code has been updated
and tested on multiple platforms and conforms to the ANSI
ISO Final Draft standard. Before covering algorithms and
data structures, the author provides a brief introduction
to C++ for programmers nfamiliar with the language. All of
the source code will be available over the Internet. Dr.
Weiss also distinguishes the book with his clear,
friendly writing style, logical organization of topics, and
extensive use of figures and examples that show the
successive stages of an algorithm.
Table of contents :
- Introduction
- What's the Book About?
- Mathematics Review
- A Brief Introduction to Recursion
- C++ Classes
- C++ Details
- Templates
- Using Matrices
- Algorithm Analysis
- Mathematical Background Model What to Analyze Running Time Calculations
- Lists, Stacks, and Queues
- Abstract Data Types (ADTs)
- The List ADT
- The Stack ADT
- The Queue
- ADT Trees
- Preliminaries
- Binary Trees
- The Search Tree ADT: Binary Search Trees
- AVL Trees
- Splay Trees
- Tree Traversals (Revisited)
- B-Trees
- Hashing
- General Idea
- Hash Function
- Separate Chaining
- Open Addressing
- Rehashing
- Extendible Hashing
- Priority Queues (Heaps)
- Model
- Simple Implementations
- Binary Heap
- Applications of Priority Queues
- d-heaps
- Leftist Heaps
- Skew Heaps
- Binomial Queues
- Sorting
- Preliminaries
- Insertion Sort
- A Lower Bound for Simple Sorting Algorithms
- Shellsort
- Heapsort
- Mergesort
- Quicksort
- Sorting Large Structures
- A General Lower Bound for Sorting
- Bucket Sort
- External Sorting
- The Disjoint Set ADT
- Equivalence Relations
- The Dynamic Equivalence Problem
- Basic Data Structure
- Smart Union Algorithms
- Path Compression
- Worst Case for Union-by Rank and Path Compression
- An Application
- Graph Algorithms
- Definitions
- Topological Sort
- Shortest-Path Algorithms
- Network Flow Problems
- Minimum Spanning Tree
- Applications of Depth-First Search
- Introduction to NP-Completeness
- Algorithm Design Techniques
- Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
- Randomized Algorithms
- Backtracking Algorithms
- Amortized Analysis
- An Unrelated Puzzle
- Binomial Queues
- Skew Heaps
- Fibonacci Heaps
- Splay Trees
- Advanced Data Structures and Implementation
- Top-Down Splay Trees
- Red Black Trees
- Deterministic Skip Lists
- AA-Trees
- Treaps
- k-d Trees
- Pairing Heaps
- Appendix A: The Standard Template Library
- Introduction
- Basic STL Concepts
- Unordered Sequences: vector and list
- Sets
- Maps
- Example: Generating a Concordance
- Example: Shortest Path Calculation
- Appendix B: Vector and String Classes
- vector Class
- string Class
L'auteur - Mark Allen Weiss
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.
Caractéristiques techniques
| PAPIER | |
| Éditeur(s) | Addison Wesley |
| Auteur(s) | Mark Allen Weiss |
| Parution | 04/02/1999 |
| Nb. de pages | 536 |
| EAN13 | 9780201361223 |
Avantages Eyrolles.com
Livraison à partir de 0,01 € en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse
