TY - BOOK AU - Neapolitan,Richard E. AU - Naimipour,Kumarss AU - Neapolitan,Richard E. TI - Foundations of algorithms using C++ pseudocode SN - 0763706205 (hbk) U1 - 005.1 PY - 1998/// CY - Sudbury, Mass. PB - Jones and Bartlett Publishers KW - Algorithms KW - Computational complexity KW - Constructive mathematics N1 - Rev. ed. of : Foundations of algorithms. Lexington, Mass. : D.C. Heath, c1996; Ch. 1. Algorithms : efficiency, analysis, and order. - Ch. 2. Divide-and-conquer. - Ch. 3. Dynamic programming. - Ch. 4. The greedy approach. - Ch. 5. Backtracking. - Ch. 6. Branch-and-bound. - Ch. 7. Introduction to computational complexity : the sorting problem. - Ch. 8. More computational complexity : the searching problem. - Ch. 9. Computational complexity and intractability : an introduction to the theory of NP. - Ch. 10. 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. - Index ER -