Cormen, Thomas H <br/><br/>
Algorithms unlocked 

 - Cambridge,   Massachusetts : The MIT Press,   2013. 
 - 222 pages :   23 cm. 
<br/><br/>Preface -- 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 -- Bibliography -- Index. 
<br/><br/><label>ISBN: </label>9780262518802 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms
<br/><br/><label>Dewey Class. No.: </label>005.1