Cormen, Thomas H. <br/><br/>
Algorithms unlocked / 
Thomas H. Cormen. 
 - xiii, 222 pages :  illustrations ;  23 cm. 
<br/><br/>Includes bibliographical references (pages 213-214) and index. 
<br/><br/>What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems. 
<br/><br/><label>ISBN: </label>0262518805 (pbk. : alk. paper) 9780262518802 (pbk. : alk. paper) 
<br/><br/><label>LCCN: </label>2012-036810 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43  / C685 2013 
<br/><br/><label>Dewey Class. No.: </label>005.1