Cormen, Thomas H. <br/><br/>
Introduction to algorithms (Instructor's manual) - (E-BOOK) 
Thomas H. Cormen ... [et al.]. 
 - 2nd ed. 
 - Cambridge, Mass. :  MIT Press,  c2009. 
 - xix, 1292 p. :  ill. ;  24 cm. 
<br/><br/>Revision History (Page-1), Getting Started (Page-25), Growth Of Functions (Page-45), Recurrences (Page-75),Probabilistic Analysis And Randomized Algorithms (Page-105), Quicksort (Page-125), Sorting In Linear Time (Page-144), Medians And Order Statistics (Page-170), Hash Tables (Page-188), Binary Search Trees (Page-205),  Augmenting Data Structures (Page-240), Greedy Algorithms (Page-290), Data Structures For Disjoint Sets (Page-330), Elementary Graph Algorithms (Page-355),Minimum Spanning Trees (Page-380),  Single-Source Shortest Paths (Page-410). 
<br/><br/><label>ISBN: </label>0262033844 (hardcover : alk. paper) 0262533057 (pbk. : alk. paper) 9780262033848 (hardcover : alk. paper) 9780262533058 (pbk. : alk. paper) 
<br/><br/><label>LCCN: </label>2009008593 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.<br/>Computer programming.
<br/><br/><label>Subjects--Geographic Terms: </label><br/>E-BOOK
<br/><br/><label>Dewey Class. No.: </label>005.1