Cormen, Thomas H <br/><br/>
Introduction to algorithms 

 - 3rd Ed. 
 - ©2009.  Cambridge, Mass. :   MIT Press, PHI. 
 - xix, 1292 pages :   illustrations,  24 cm. 
<br/><br/> I. Foundations. The role of algorithms in computing --  II. Sorting and order statistics. Heapsort --  III. Data structures. Elementary data structures --  IV. Advanced design and analysis techniques. Dynamic programming --  V. Advanced data structures. B-trees --  VI. Graph algorithms. Elementary graph algorithms --  VII. Selected topics. Multithreaded algorithms --  VIII. Appendix: Mathematical background. Summations -- 
<br/><br/> This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks. 
<br/><br/><label>ISBN: </label>9788120340077 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming<br/>Computer algorithms<br/>Algorithms<br/>Data structures (Computer science)
<br/><br/><label>Dewey Class. No.: </label>004.421 COR