an:00194559
Zbl 0717.68005
Sedgewick, Robert
Algorithms. 2nd ed
EN
Addison-Wesley Series in Computer Science. Reading, MA: Addison-Wesley. XII, 657 p.640 p. DM 80.00 (1989).
1989
b
68-01 68W10 68N01 68P10 68Q25 68P05
PASCAL; string processing; pattern matching; parsing; cryptology; geometric algorithms; graph algorithms; mathematical algorithms; dynamic programming; linear programming; exhaustive search; NP-complete problems
Summary: For the review of the first edition (Reading, Massachusetts; 1983) see Zbl 0529.68002. From the preface: ``This second edition incorporates corrections, updated information, and improvements throughout, including three major changes with significant impact overall.
First, a new section covering introductory material on data structures and the design and analysis of algorithms has been added. This sets the tone for the rest of the book and provides a framework within which more advanced algorithms are treated. Some readers may skip or skim this section; others may learn the basics there.
Second, the analysis of the algorithms is developed more fully and more rigorously than in the first edition. Specific information on performance characteristics of algorithms is encapsulated throughout in ``properties'', important facts about the algorithms that deserve further study.
Third (and this change is most evident), hundreds of figures have been added. Many algorithms are brought to light on an intuitive level through the visual dimension provided by these figures.''
Zbl 0529.68002