parts1-4 Fundamentals, data structures, sorting, searching ISBN 9780201350883
Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.
FUNDAMENTALS. 1. Introduction. Algorithms.A Sample Problem-Connectivity.Union-Find Algorithms.Perspective.Summary of Topics.2. Principles of Algorithm Analysis. Implementation and Empirical Analysis.Analysis of Algorithms.Growth of Functions.Big-Oh Notation.Basic Recurrences.Examples of Algorithm Analysis.Guarantees, Predictions, and Limitations.DATA STRUCTURES. 3. Elementary Data Structures. Building Blocks.Arrays.Linked Lists.Elementary List Processing.Memory Allocation for Lists.Strings.Compound Data Structures.4. Abstract Data Types. Abstract Objects and Collections of Objects.Pushdown Stack ADT.Examples of Stack ADT Clients.Stack ADT Implementations.Creation of a New ADT.FIFO Queues and Generalized Queues.Duplicate and Index Items.First-Class ADTs.Application-Based ADT Example.Perspective.5. Recursion and Trees. Recursive Algorithms.Divide and Conquer.Dynamic Programming.Trees.Mathematical Properties of Trees.Tree Traversal.Recursive Binary-Tree Algorithms.Graph Traversal.Perspective.SORTING. 6. Elementary Sorting Methods. Rules of the Game.Selection Sort.Insertion Sort.Bubble Sort.Performance Characteristics of Elementary Sorts.Shellsort.Sorting Other Types of Data.Index and Pointer Sorting.Sorting Linked Lists.Key-Indexed Counting.7. Quicksort. The Basic Algorithm.Performance Characteristics of Quicksort.Stack Size.Small Subfiles.Median-of-Three Partitioning.Duplicate Keys.Strings and Vectors.Selection.8. Merging and Mergesort. Two-Way Merging.Abstract In-Place Merge.Top-Down Mergesort.Improvements to the Basic Algorithm.Bottom-Up Mergesort.Performance Characteristics of Mergesort.Linked-List Implementations of Mergesort.Recursion Revisited.9. Priority Queues and Heapsort. Elementary Implementations.Heap Data Structure.Algorithms on Heaps.Heapsort.Priority-Queue ADT.Priority Queues for Index Items.Binomial Queues.10. Radix Sorting. Bits, Bytes, and Words.Binary Quicksort.MSD Radix Sort.Three-Way Radix Quicksort.LSD Radix Sort.Performance Characteristics of Radix Sorts.Sublinear-Time Sorts.11. Special-Purpose Sorts. Batcher's Odd-Even Mergesort.Sorting Networks.External Sorting.Sort-Merge Implementations.Parallel Sort/Merge.SEARCHING. 12. Symbol Tables and BSTs. Symbol-Table Abstract Data Type.Key-Indexed Search.Sequential Search.Binary Search.Binary Search Trees (BSTs).Performance Characteristics of BSTs.Index Implementations with Symbol Tables.Insertion at the Root in BSTs.BST Implementations of Other ADT Functions.13. Balanced Trees. Randomized BSTs.Splay BSTs.Top-Down 2-3-4 Trees.Red-Black Trees.Skip Lists.Performance Characteristics.Separate Chaining.Linear Probing.Double Hashing.Dynamic Hash Tables.Perspective.15. Radix Search. Digital Search Trees.Tries.Patricia Tries.Multiway Tries and TSTs.Text String Index Applications.16. External Searching. Rules of the Game.Indexed Sequential Access.B Trees.Extendible Hashing.Perspective.Index. 0201350882T04062001
part5 Graph algorithms ISBN 9780201361186
Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).
17. Graph Properties and Types. Glossary.Graph ADT.Adjacency-Matrix Representation.Adjacency-Lists Representation.Variations, Extensions, and Costs.Graph Generators.Simple, Euler, and Hamilton Paths.Graph-Processing Problems.18. Graph Search. Exploring a Maze.Depth-First Search.Graph-Search ADT Functions.Properties of DFS Forests.DFS Algorithms.Separability and Biconnectivity.Breadth-First Search.Generalized Graph Search.Analysis of Graph Algorithms.19. Digraphs and DAGs. Glossary and Rules of the Game.Anatomy of DFS in Digraphs.Reachability and Transitive Closure.Equivalence Relations and Partial Orders.DAGs.Topological Sorting.Reachability in DAGs.Strong Components in Digraphs.Transitive Closure Revisited.Perspective.20. Minimum Spanning Trees. Representations.Underlying Principles of MST Algorithms.Prim's Algorithm and Priority-First Search.Kruskal's Algorithm.Boruvka's Algorithm.Comparisons and Improvements.Euclidean MST.21. Shortest Paths. Underlying Principles.Dijkstra's algorithm.All-Pairs Shortest Paths.Shortest Paths in Acyclic Networks.Euclidean Networks.Reduction.Negative Weights.Perspective.22. Network Flow. Flow Networks.Augmenting-Path Maxflow Algorithms.Preflow-Push Maxflow Algorithms.Maxflow Reductions.Mincost Flows.Network Simplex Algorithm.Mincost-Flow Reductions.Perspective.References for Part Five. Index. 0201361183T12172001
「Nielsen BookData」 より