Foundations of Algorithms Using C++ Pseudoc

Foundations of Algorithms Using C++ Pseudocode, Third Editionby Richard Neapolitan and Kumarss Naimipour

ISBN:0763723878

Jones and Bartlett Publishers 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 Preface Chapter 1 - AlgorithmsEfficiency, Analysis, and OrderChapter 2 - Divide-and-ConquerChapter 3 - Dynamic ProgrammingChapter 4 - The Greedy ApproachChapter 5 - BacktrackingChapter 6 - Branch-and-Bound

Chapter 7 - Introduction to Computational ComplexityThe Sorting Problem

Chapter 8 - More Computational ComplexityThe Searching Problem

Chapter 9 - Computational Complexity and InteractabilityAn Introduction to the Theory of NPChapter 10 - Number-Theoretic AlgorithmsChapter 11 - Introduction to Parallel AlgorithmsAppendix A - Review of Necessary Mathematics

Appendix B - Solving Recurrence EquationsWith Applications to Analysis of Recursive AlgorithmsAppendix C - Data Structures for Disjoint SetsReferences Index List of Figures List of Tables List of Algorithms, Examples, and Theorems List of Sidebars

Page 1 of 1toc

19/5/2015file:///C:/Users/koutrgor/AppData/Local/Temp/~hh19FA.htm