Horowitz, Ellis <br/><br/>
Fundamentals of computer algorithms 
Horowitz, Ellis 
 - 2nd ed. 
 - Hyderabad  University Press  2008 
 - xx, 773 p.   
 - Computer software engineering series .
<br/><br/> This is the thoroughly revised and updated edition of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications,  bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. The second edition of Fundamentals of Computer Algorithms emphasizes:   Design techniques: Divide and conquer,  the greedy method,  dynamic programming,  backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.   Examples: A wide range of examples provides students with the actual implementation of correct design.   The latest research: A thorough treatment of probabilistic and parallel algorithms is included.   Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.   
<br/><br/><label>ISBN: </label>9788173716126 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Electronic digital computers - Programming<br/>Algorithms
<br/><br/><label>Dewey Class. No.: </label>519.92