Foundations of algorithms using C++ pseudocode
By: Richard E. Neapolitan, Kumarss Naimipour.
Contributors: Naimipour, Kumarss.; Neapolitan, Richard E.
Edition: 2nd ed.
Publisher: Jones and Bartlett Publishers
Published: 1998
Place of publication: Sudbury, Mass
Language: eng
Number of pages: 523
ISBN-13: 9780763706203
Subjects: Algorithms.; Constructive mathematics.; Computational complexity.
First sentence: This text is about techniques for solving problems using a computer.
Notes: Includes bibliographical references (p. 513-515) and index.
Rev. ed. of: Foundations of algorithms. Lexington, Mass. : D.C. Heath, c1996.
Table of contents: value: Algorithms: Efficiency, Analysis, and Order; value: Divide-and-Conquer; value: Dynamic Programming; value: The Greedy Approach; value: Backtracking; value: Branch-and-Bound; value: Introduction to Computational Complexity: The Sorting Problem; value: More Computational Complexity: The Searching Problem; value: Computational Complexity and Intractability: An Introduction to the Theory of NP; value: Introduction to Parallel Algorithms