Neapolitan, Richard E. <br/><br/>
Foundations of algorithms using Java pseudocode / 
Richard Neapolitan, Kumarss Naimipour. 
 - Sudbury, Mass. :  Jones and Bartlett,  2004. 
 - xv, 618 p. :  ill ;  24 cm. 
<br/><br/> Includes bibliographical references and index.   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. Number-Theoretic Algorithms -- Ch. 11. Introduction to Parallel Algorithms -- App. B. Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms -- App. C. Data Structures for Disjoint Sets. 
<br/><br/>
<br/><br/><label>ISBN: </label>9780763721299 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>