The Algorithm Design Manual

Description

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: • Doubles the tutorial material and exercises over the first edition • Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video • 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 • Includes several NEW "war stories" relating experiences from real-world applications • Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Other editions

• 

  The Algorithm Design Manual: Text

  • 1998
  • 486 pages
  • Paperback
  • Springer Science & Business Media
• 

  The Algorithm Design Manual

  • 2021-10-20
  • 793 pages
  • Paperback
  • Springer

Similar books

• 

  The Data Science Design Manual

  By Steven S. Skiena

  This effect size can be measured by: d = (|μ − μ|)/σ. A reasonable threshold for a small effect size is > 0.2, medium effect > 0.5, and large effect size > 0.8. • Pearson's correlation coefficient r: Measures the degree of linear ...

• 

  Programming Challenges: The Programming Contest Training Manual

  By Steven S Skiena, Miguel A. Revilla

  This book contains over 100 problems that have appeared in previous programming contests, along with discussions of the theory and ideas necessary to attack them.

• 

  A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis

  By Frederic Vivien, Anne Benoit, Yves Robert

  + n, (S. P.,k ..) = (2 + n)Gn(z). k=1 k=1 Since G1(z) = P.12 = 2, we obtain G., (z) = 2 (2 + 1) . . . (2 + n – 1). We now need to link the value that we want to compute, namely the average complexity of Algorithm 1.3, to this function ...

• 

  Algorithm Design

  By Jon Kleinberg, Éva Tardos

  This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book. Algorithm Design...

• 

  Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®

  By Steven Skiena, Sriram Pemmaraju

  This book was first published in 2003.

• 

  7 Algorithm Design Paradigms

  By Sung-Hyuk Cha

  Rather than providing students simply with the best known algorithm for a problem, this book presents various algorithms for readers to master various algorithm design paradigms.

• 

  Grokking Algorithms: An illustrated guide for programmers and other curious people

  By Aditya Bhargava

  "This book does the impossible: it makes math fun and easy!

• 

  Mathematics for Algorithm and Systems Analysis

  By Stanley Gill Williamson, Edward A. Bender

  Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications.

• 

  Algorithms in a Nutshell

  By Gary Pollice, George T. Heineman, Stanley Selkow

  With this book, you will: Solve a particular coding problem or improve on the performance of an existing solution Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right ...

• 

  Interpretable Machine Learning

  By Christoph Molnar

  This book is about making machine learning models and their decisions interpretable.