Neapolitan, Richard E. <br/><br/>
Foundations of algorithms /  
Richard Neapoltian, Kumarss Naimipour. 
 - 4th ed. 
 - Sudbury, Mass. :  Jones and Bartlett Publishers,  c2011. 
 - xv, 627 p. L  ill. ;  24 cm. 
<br/><br/>Algorithms: efficiency, analysis, and order (Page-1),  Divide-and-conquer (Page-47),  Dynamic programming  (Page-91), The greedy approach  (Page-145),  Backtracking  (Page-197),  Branch-and-bound (Page-243),  Introduction to computational complexity : the sorting problem  (Page-277),  More computational complexity : the searching problem (Page-329),  Computational complexity and intractability : an introduction to the theory of NP  (Page-385),  Number-theoretic algorithms  (Page-429),  Introduction to parallel algorithms (Page-495), . 
<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,NEA