Overview
....The most comprehensive guide to designing practical and efficient algorithms!....
The Algorithm Design Manual, Second Edition
.,. the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject. --ACM Computing Reviews
It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources. -- P. Takis Metaxas, Wellesley College
This is the most approachable book on algorithms I have. -- Megan Squire, Elon University, USA
This newly expanded and updated second edition of the best-selling classic continues to take the mystery out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.
The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.
NEW to the second edition:
a [ Doubles the tutorial material and exercises over the first edition
a[ Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video
a [ Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them
a [ Includes several NEW war stories relating experiences from real-world applications
a [ Provides up-to-date links leading to the very best algorithm implementations available in C, C]+, and Java
ADDITIONAL Learning Tools:
a [ Exercises include job interview problems from major software companies
a [ Highlighted take-home lesson boxes emphasize essential concepts
a [ Provides comprehensive references to both survey articles and the primary literature
a [ Exercises points to relevant programming contest challenge problems
a [ Many algorithms presented with actual code (written in C) as well as pseudo-code
a [ A full set of lecture slides and additional material available at www.algorist.com
Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.
Full Product Details
Author: Steven S Skiena
Publisher: Springer
Imprint: Springer
Edition: 2nd
Dimensions:
Width: 25.40cm
, Height: 3.70cm
, Length: 17.80cm
Weight: 1.275kg
ISBN: 9781848821972
ISBN 10: 1848821972
Pages: 748
Publication Date: 12 May 2009
Audience:
General/trade
,
General
Format: Undefined
Publisher's Status: Unknown
Availability: Out of stock
Reviews
From the reviews of the second edition: <p>.,. the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject. (ACM Computing Reviews) <p> My absolute favorite for this kind of interview preparation is Steven Skienaa (TM)s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace a ] graph problems are -- they should be part of every working programmera (TM)s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. a ] every 1 a pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types. (Steve Yegge, Steve Yeggea (TM)s Blog, March, 2008)
