Harris, Simon,  1972- <br/><br/>
Beginning algorithms / 
Simon Harris and James Ross. 
 - Indianapolis, IN :  Wiley,  2006. 
 - xxvi, 564 p. :  ill. ;  24 cm. 
 - Wrox beginning guides .
 - Wrox beginning guides. .
<br/><br/> "Programmer to programmer"--Cover. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Getting started -- Iteration and recursion -- String searching -- Lists -- Queues -- Stacks -- Basic sorting -- Advance sorting -- Priority queues -- Binary searching -- Binary search trees -- Red-black trees -- Hashing -- Sets -- Maps -- Computational geometry -- Digital search trees -- B-trees -- Pragmatic optimisation. 
<br/><br/> "Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development."--BOOK JACKET. 
<br/><br/><label>ISBN: </label>9780764596742 (paper/website) 0764596748 (paper/website) 
<br/><br/><label>LCCN: </label>2005022374 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43  / H37 2006 
<br/><br/><label>Dewey Class. No.: </label>005.1