George T. Heineman, Gary Pollice & Stanley Selkow.
Second edition.
xi, 373 pages :
illustrations ;
23 cm.
In a nutshell.
Includes bibliographical references and index.
Thinking in algorithms -- The mathematics of algorithms -- Algorithm building blocks -- Sorting algorithms -- Searching -- Graph algorithms -- Path finding in AI -- Network flow algorithms -- Computational geometry -- Spatial tree structures -- Emerging algorithm categories -- Principles of algorithms -- Benchmarking.
0
This book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.