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/>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/> Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts. 
<br/><br/><label>ISBN: </label>9780763782504 
<br/><br/><label>LCCN: </label>2009040309 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Constructive mathematics.<br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>518.1