Neapolitan, Richard E. <br/><br/>
Foundations of algorithms / 
Richard Neapoltian and Kumarss Naimipour. 
 - 4th ed. 
 - Sudbury, Mass. :  Jones and Bartlett Publishers,  c2011. 
 - xv, 627 p. L  ill. ;  24 cm. 
<br/><br/> Rev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004. 
<br/><br/>Includes bibliographical references (p. [609]-613) and index. 
<br/><br/>Algorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms. 
<br/><br/><label>ISBN: </label>9780763782504 (casebound) 0763782505 (casebound) 
<br/><br/><label>LCCN: </label>2009040309 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Constructive mathematics.<br/>Computational complexity.
<br/><br/><label>LC Class. No.: </label>QA9.58  / .N43 2011 
<br/><br/><label>Dewey Class. No.: </label>518.1