<a border="0"></a><a border="0">Foundations of Algorithms Using C++ Pseudocode, Third Edition</a>by聽Richard Neapolitan聽and聽Kumarss Naimipour聽 ISBN:0763723878<a>Jones and Bartlett Publishers</a> 漏 2004 (618 pages)This text offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity that is accessible to mainstream computer science students. Table of Contents [Foundations of Algorithms Using C++ Pseudocode, Third Edition](LiB0001.html)[Preface](LiB0002.html)[Chapter 1](LiB0008.html)- Algorithms鈥擡fficiency, Analysis, and Order[Chapter 2](LiB0014.html)- Divide-and-Conquer[Chapter 3](LiB0024.html)- Dynamic Programming[Chapter 4](LiB0032.html)- The Greedy Approach[Chapter 5](LiB0039.html)- Backtracking[Chapter 6](LiB0047.html)- Branch-and-Bound[Chapter 7](LiB0052.html)- Introduction to Computational Complexity鈥擳he Sorting Problem[Chapter 8](LiB0067.html)- More Computational Complexity鈥擳he Searching Problem[Chapter 9](LiB0074.html)- Computational Complexity and Interactability鈥擜n Introduction to the Theory of NP[Chapter 10](LiB0080.html)- Number-Theoretic Algorithms[Chapter 11](LiB0089.html)- Introduction to Parallel Algorithms[Appendix A](LiB0093.html)- Review of Necessary Mathematics[Appendix B](LiB0102.html)- Solving Recurrence Equations鈥擶ith Applications to Analysis of Recursive Algorithms[Appendix C](LiB0108.html)- Data Structures for Disjoint Sets[References](LiB0109.html)[Index](LiB0110.html)[List of Figures](LiB0135.html)[List of Tables](LiB0136.html)[List of Algorithms, Examples, and Theorems](LiB0137.html)[List of Sidebars](LiB0138.html)