Description

Table of Contents

FUNDAMENTALS.

DATA STRUCTURES.

SORTING.

SEARCHING.

Courses

C++--Algorithms/Advanced Data Structures  [PTG: AW PROFESSIONAL]   (Computer Science)
C++--Algorithms  [PTG: AW PROFESSIONAL]   (Computer Science)

Previous Edition(s)

• Algorithms in C++
  Sedgewick
  ©1992  |  Addison-Wesley Professional  |  Cloth; 672 pp  |  Out of Stock
  ISBN-10: 0201510596  |  ISBN-13: 9780201510591
    Brief Description  | 

  

  This version of Sedgewick's bestselling book provides a comprehensive collection of algorithms implemented in C++. The algorithms included cover a broad range of fundamental and more advanced methods: sorting, searching, string processing, geometric, graph, and mathematical algorithms. Readers will discover-in an object-oriented programming environment-how key algorithms can be implemented, run, debugged, and used in real applications.

  FUNDAMENTALS.

  1. Introduction.
  

  Algorithms.
  Outline of Topics.
  

  
  2. C++ (AND C) Example: Euclid's Algorithm.
  

  Types of Data.
  Input/Output.
  Concluding Remarks
  

  
  3. Elementary Data Structures.
  

  Arrays.
  Linked Lists.
  Storage Allocation.
  Pushdown Stacks.
  Queues.
  Abstract and Concrete Data Types.
  

  
  4. Trees.
  

  Glossary.
  Properties.
  Representing Binary Trees.
  Representing Forests.
  Traversing Trees.
  

  
  5. Recursion.
  

  Recurrences.
  Divide-and-Conquer.
  Recursive Tree Traversal.
  Removing Recursion.
  Perspective.
  

  
  6. Analysis of Algorithms.
  

  Selecting an Algorithm.
  Empirical Analysis.
  Program
  Optimization.
  Algorithms and Systems
  

  
  

  SORTING ALGORITHMS.

  7. Elementary Sorting Methods.
  

  Rules of the Game.
  Selection Sort.
  Insertion Sort.
  Digression: Bubble Sort.
  Performance Characteristics of Elementary Sorts.
  Sorting Files with Large Records.
  Shellsort.
  Distribution Counting.
  

  
  8. Quicksort.
  

  The Basic Algorithm.
  Performance Characteristics of Quicksort.
  Removing Recursion.
  Small Subfiles.
  Median-of-Three Partitioning.
  Selection.
  

  
  9. Radix Sorting.
  

  Bits.
  Radix Exchange Sort.
  Straight Radix Sort.
  Performance Characteristics of Radix Sorts.
  A Linear Sort.
  

  
  10. Priority Queues.
  

  Elementary Implementations.
  Heap Data Structure.
  Algorithms on Heaps.
  Heapsort.
  Indirect Heaps.
  Advanced Implementations
  

  
  11. Mergesort.
  

  Merging.
  Mergesort.
  Lit Mergesort.
  Bottom-Up Mergesort.
  Performance Characteristics.
  Optimized Implementations.
  Recursion Revisited.
  

  
  12. External Sorting.
  

  Sort-Merge.
  Balanced Multiway Merging.
  Replacement
  Selection.
  Practical Considerations.
  Polyphase Merging.
  An Easier Way
  

  
  

  SEARCHING ALGORITHMS.

  13. Elementary Searching Methods.
  

  Sequential Searching Methods.
  Binary Search.
  Binary Tree Search.
  Deletion.
  Indirect Binary Search Trees.
  

  
  14. Balanced Trees.
  

  Top-Down 2-3-4 Trees.
  Red-Black Trees.
  Other Algorithms.
  

  
  15. Hashing.
  

  Hash Functions.
  Separate Chaining.
  Linear Probing.
  Double Hashing.
  Perspective
  

  
  16. Radix Searching.
  

  Digital Search Trees.
  Radix Search Tries.
  Multiway Radix Searching.
  Patricia.
  

  
  17. External Searching.
  

  Indexed Sequential Access.
  B-Trees.
  Extendible Hashing.
  Virtual Memory.
  

  
  

  STRING PROCESSING.

  18. String Searching.
  

  A Short History.
  Brute-Force Algorithm.
  Knuth-Morris-Pratt Algorithm.
  Boyer-Moore Algorithm.
  Rabin-Karp Algorithm.
  Multiple Searches.
  

  
  19. Pattern Matching.
  

  Describing Patterns.
  Pattern Matching Machines.
  Representing the Machine.
  Simulating the Machine.
  

  
  20. Parsing.
  

  Context-Free Grammars.
  Top-Down Parsing.
  Bottom-Up Parsing.
  Compilers.
  Compiler-Compilers.
  

  
  21. File Compression.
  

  Run-Length Encoding.
  Variable-Length Encoding.
  Building the Huffman Code.
  Implementation.
  

  
  22. Cryptology.
  

  Rules of the Game.
  Simple Methods.
  Encryption/Decryption Machines.
  Public-Key Cryptosystems.
  

  
  

  GEOMETRIC ALGORITHMS.

  23. Elementary Geometric Methods.
  

  Points, Lines, and Polygons.
  Line Segment Intersection.
  Simple Closed Path.
  Inclusion in a Polygon.
  Perspective.
  

  
  24. Finding the Convex Hull.
  

  Rules of the Game.
  Package-Wrapping.
  The Graham Scan.
  Interior Elimination.
  Performance Issues.
  

  
  25. Range Searching.
  

  Elementary Methods.
  Grid Method.
  Two-Dimensional Trees.
  Multidimensional Range Searching.
  

  
  26. Geometric Intersection.
  

  Horizontal and Vertical Lines.
  Implementation.
  General Line Intersection.
  

  
  27. Closest-Point Problems.
  

  Closest-Pair Problem.
  Voronoi Diagrams.
  

  
  

  GRAPH ALGORITHMS.

  28. Elementary Graph Algorithms.
  

  Glossary.
  Representation.
  Depth-First Search.
  Nonrecursive Depth-First Search.
  Breadth-First Search.
  Mazes.
  Perspective.
  

  
  29. Connectivity.
  

  Connected Components.
  Biconnectivity.
  Union-Find Connectivity.
  

  
  30. Weighted Graphs.
  

  Minimum Spanning Tree.
  Priority-First Search.
  Kruskal's Method.
  Shortest Path.
  Minimum Spanning Tree and Shortest Paths in Dense Graphs.
  Geometric Problems.
  

  
  31. Directed Graphs.
  

  Depth-First Search.
  Transitive Closure.
  All Shortest Paths.
  Topological Sorting.
  Strongly Connected Components.
  

  
  32. Network Flow.
  

  The Network Flow Problem.
  Ford-Fulkerson Method.
  Network Searching.
  

  
  33. Matching.
  

  Bipartite Graphs.
  Stable Marriage Problems.
  Advanced Algorithms.
  

  
  

  MATHEMATICAL ALGORITHMS.

  34. Random Numbers.
  

  Applications.
  Linear Congruential Method.
  Additive Congruential Method.
  Testing Randomness.
  Implementational Notes.
  

  
  35. Arithmetic.
  

  Polynomial Arithmetic.
  Polynomial Evaluation and Interpolation.
  Polynomial Multiplication.
  Arithmetic Operations with Large Integers.
  Matrix Arithmetic.
  

  
  36. Gaussian Elimination.
  

  A Simple Example.
  Outline of the Method.
  Variations and Extensions.
  

  
  37. Curve Fittings.
  

  Polynomial Interpolation.
  Spline Interpolation.
  Method of Least Squares.
  

  
  38. Integration.
  

  Symbolic Integration.
  Simple Quadrature Methods.
  Compound Methods.
  Adaptive Quadrature.
  

  
  

  ADVANCED TOPICS.

  39. Parallel Algorithms.
  

  General Approaches.
  Perfect Shuffles.
  Systolic Arrays.
  Perspective.
  

  
  40. The Fast Fourier Transform.
  

  Evaluate, Multiply, Interpolate.
  Complex Roots of Unity.
  Evaluation at the Roots of Unity.
  Interpolation at the Roots of Unity.
  Implementation.
  

  
  41. Dynamic Programming.
  

  Knapsack Problem.
  Matrix Chain Product.
  Optimal Binary Search Trees.
  Time and Space Requirements.
  

  
  42. Linear Programming.
  

  Linear Programs.
  Geometric Interpretation.
  The Simplex Method.
  Implementation.
  

  
  43. Exhaustive Search.
  

  Exhaustive Search in Graphs.
  Backtracking.
  Digression: Permutation Generation.
  Approximation Algorithms.
  

  
  44. NP-Complete Problems.
  

  Deterministic and Nondeterministic Polynomial-Time Algorithms.
  NP-Completeness.
  Cook's Theorem.
  Some NP-Complete Problems. 0201510596T04062001
  

  
  

  CS0701:

  Algorithms

  More Info
  

Author Bios

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

Christopher J. Van Wyk is Professor of Mathematics and Computer Science at Drew University. The author of Data Structures and C Programs (Addison-Wesley, 1988), he has served on the research staff at Bell Laboratories, where he is now a consultant. Robert Sedgewick and Christopher Van Wyk both earned their Ph.D. degrees from Stanford University under Donald E. Knuth.

Backcover Copy

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.

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

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, browse our available packages below, or contact your Pearson Higher Education representative to create your own package.

Package ISBN-10: 020172684X | ISBN-13: 9780201726848
©2002 | Instock
Suggested retail price: $112.50  Buy from myPearsonStore
Net price: $76.50  (What's this?)
This package contains:

Package ISBN-10: 0132849151 | ISBN-13: 9780132849159
©2002 | Instock (Additional assembly time required)
Suggested retail price: $140.85  Buy from myPearsonStore
Net price: $140.85  (What's this?)
This package contains:

Package ISBN-10: 0321735374 | ISBN-13: 9780321735379
©2006 | Instock (Additional assembly time required)
Suggested retail price: $115.50  Buy from myPearsonStore
Net price: $115.50  (What's this?)
This package contains: