文档介绍：The Algorithm Design Manual
Next: Preface Up: Main Page
The Algorithm Design
Manual
Steven S. Skiena
Department puter Science
State University of New York
Stony Brook, NY 11794-4400
******@
Copyright © 1997 by Springer-Verlag, New York
● Contents
● Techniques
❍ Introduction to Algorithms
❍ Data Structures and Sorting
❍ Breaking Problems Down
❍ Graph Algorithms
❍ Combinatorial Search and Heuristic Methods
❍ Intractable Problems and Approximations
❍ How to Design Algorithms
● Resources
❍ A Catalog of Algorithmic Problems
❍ Algorithmic Resources
● References
● Index
● About this document ...
file:///E|/BOOK/BOOK/ (1 of 2) [19/1/2003 1:27:29]
The Algorithm Design Manual
Algorithms
Mon Jun 2 23:33:50 EDT 1997
file:///E|/BOOK/BOOK/ (2 of 2) [19/1/2003 1:27:30]
Preface
Next: Acknowledgments Up: The Algorithm Design Manual Previous: The Algorithm Design Manual
Preface
Most of the professional programmers that I've encountered are not well prepared to tackle algorithm
design problems. This is a pity, because the techniques of algorithm design form one of the core practical
technologies puter science. Designing correct, efficient, and implementable algorithms for real-
world problems is a tricky business, because the essful algorithm designer needs access to two
distinct bodies of knowledge:
● Techniques - Good algorithm designers understand several fundamental algorithm design
techniques, including data structures, dynamic programming, depth-first search, backtracking, and
heuristics. Perhaps the single most important design technique is modeling, the art of abstracting a
messy real-world application into a clean problem suitable for algorithmic attack.
● Resources - Good algorithm designers stand on the shoulders of giants. Rather than laboring from
scratch to produce a new algorithm for every task, they know how to find out what