What is included with this book?
Fundamentals | |
Introduction | p. 3 |
C++ (and C) | p. 7 |
Elementary Data Structures | p. 15 |
Trees | p. 35 |
Recursion | p. 51 |
Analysis of Algorithms | p. 67 |
Implementation of Algorithms | p. 81 |
Sorting Algorithms | |
Elementary Sorting Methods | p. 93 |
Quicksort | p. 115 |
Radix Sorting | p. 133 |
Priority Queues | p. 145 |
Mergesort | p. 163 |
External Sorting | p. 177 |
Searching Algorithms | |
Elementary Searching Methods | p. 193 |
Balanced Trees | p. 215 |
Hashing | p. 231 |
Radix Searching | p. 245 |
External Searching | p. 259 |
String Processing | |
String Searching | p. 277 |
Pattern Matching | p. 293 |
Parsing | p. 305 |
File Compression | p. 319 |
Cryptology | p. 333 |
Geometric Algorithms | |
Elementary Geometric Methods | p. 347 |
Finding the Convex Hull | p. 359 |
Range Searching | p. 373 |
Geometric Intersection | p. 389 |
Closest-Point Problems | p. 401 |
Graph Algorithms | |
Elementary Graph Algorithms | p. 415 |
Connectivity | p. 437 |
Weighted Graphs | p. 451 |
Directed Graphs | p. 471 |
Network Flow | p. 485 |
Matching | p. 495 |
Mathematical Algorithms | |
Random Numbers | p. 509 |
Arithmetic | p. 521 |
Gaussian Elimination | p. 535 |
Curve Fitting | p. 545 |
Integration | p. 555 |
Advanced Topics | |
Parallel Algorithms | p. 569 |
The Fast Fourier Transform | p. 583 |
Dynamic Programming | p. 595 |
Linear Programming | p. 607 |
Exhaustive Search | p. 621 |
NP-Complete Problems | p. 633 |
Index | p. 643 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.