Cormen, Thomas H. <br/><br/>
Algorithms unlocked / 
Thomas H. Cormen. 
 - Cambridge, Massachusetts :  The MIT Press,  [2013] 
 - xiii, 222 p. :  ill. ;  23 cm 
<br/><br/>Includes bibliographical references (pages 213-214) and index. 
<br/><br/> In Algorithms Unlocked, Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.   Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time. 
<br/><br/><label>ISBN: </label>9780262518802 (pbk. : alk. paper) 
<br/><br/><label>LCCN: </label>2012036810 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.<br/>Algoritmos.<br/>Estructura de datos (Informática).<br/>Programación (Computadores electrónicos digitales).
<br/><br/><label>LC Class. No.: </label>QA 76.9  / C811a 2013 
<br/><br/><label>Dewey Class. No.: </label>005.12