CONTENTS:- Preface; Algorithms: Effiociency, Analysis, and order; Divide-and-conquer; Dynamic programming; The greedy approach; Backtracking; Branch-and-Bound; Introduction to computational compelexity: The sorting problem; More computational complexity: The searching problem; Computational complexity and interactability: An introduction to the theory of NP; Number-theoretic alogorithms; Introduction to parallel algorithms; Appendix A: Review of necessary mathematics; Appendix B: Solving recurrence equations: With applications to analysis of recursive algorithms; Appendix C: Data structures for disjoint sets; References.
Foundations of Algorithms Using C++ Pseudocode, Third edition offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background a in college algebra and discrete structures. to support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.