Algorithms by Robert Sedgewick

Algorithms by Robert Sedgewick

Algorithms is written for an introductory upper-level undergraduate or graduate course in algorithms. With/their many years of experience in teaching algorithms courses, Richard Johnsonbaugh and Marcus Schaefer include applications of algorithms, examples, end-of-section exercises, end-of-chapter exercises, solutions to selected exercises, and notes to help the reader understand and master algorithms.

• Links theory to real-world applications such as data compression, region-finding in digital pictures, cellular phone networks, and the implementation of agrep.
• Includes five chapters that emphasize design techniques: searching (including backtracking), divide and conquer, sorting, selection, the greedy method, and dynamic programming.
• Covers distributed algorithms--a topic recommended by the ACM (2001 report) for an undergraduate curriculum.
• Features a collection of techniques, including approximation, parameterization (a recent area of research), and use of heuristics, to deal with NP-complete problems.
• Contains more than 1450 carefully developed and classroom-tested exercises, from routine to challenging. About one-third of the end-of-section exercises include solutions.
• Provides a robust Companion Website that supplements the text by providing algorithm simulation software, PowerPoint^(R) slides, late breaking news about algorithms, references about the book's topics, computer programs, and more.
• Includes more than 300 worked examples, which provide motivation, clarify concepts, and show how to develop algorithms, demonstrate applications of the theory, and elucidate proofs.

William O. Sedgewick is the William O. Sedgewick is the William O. Sedgewick is the William Princeton University's Baker Professor of Computer Science He was a member of the research staffs of Xerox PARC, IDA, and INRIA before joining Adobe Systems as a Director. He received his doctorate from Stanford University, where he studied under Donald E.