Chapter1 Algorithms: Efficiency, Analysis, and Order Chapter2 Divide-and-Conquer Chapter3 Dynamic Programming Chapter4 The Greedy Approach Chapter5 Backtracking Chapter6 Branch-and-Bound Chapter7 Introduction to Computational Complexity: The Sorting Problem Chapter8 More Computational Complexity: The Searching Problem Chapter9 Computational Complexity and Intractability: An Introduction to the Theory of NP Chapter10 Genetic Algorithms Chapter11 Number-Theoretic Algorithms Chapter12 Introduction to Parallel Algorithms
What is included with this book?
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.
Please wait while the item is added to your bag...