Algorithms (Addison-Wesley series in computer science) (Hardcover)

~ (Author)

Product Details

• Hardcover: 552 pages
• Publisher: Addison Wesley Longman Publishing Co (June 1983)
• Language: English
• ISBN-10: 0201066726
• ISBN-13: 978-0201066722
• Product Dimensions: 9.3 x 6.5 x 1.2 inches
• Shipping Weight: 2 pounds
• Average Customer Review: 4.8 out of 5 stars  See all reviews (5 customer reviews)
• Amazon.com Sales Rank: #1,603,621 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

6 of 6 people found the following review helpful:

5.0 out of 5 stars My favorite introduction to algorithms, August 8, 1997

By	Spiros Papadimitriou ([e-mail]) (Crete, Greece) - See all my reviews

This review is from: Algorithms (Hardcover)

Sedgewick provides a very clear and intuitive exposition of the essence of many algorithms.

The book covers a breadth of topics, from sorting and searching, to computational geometry and mathematical algorithms. It is an extremely well-written book. Each algorithm has been carefully implemented in Pascal (you may also want to have a look at the editions of the book for C++ and other languages). It is an excellent book, both for practitioners and programmers, as well as an introduction to the theory of algorithms!
Highly recommended!

7 of 8 people found the following review helpful:

4.0 out of 5 stars Can Programs Teach Algorithms?, January 5, 2001

By	Dennis E. Hamilton "orcmid" (Seattle, WA United States) - See all my reviews (REAL NAME)

This review is from: Algorithms (Hardcover)

This book presents an interesting challenge. It talks about algorithms yet it does not present algorithms, nor does it define algorithm as anything more than a "problem-solving method suitable for implementation as computer programs[p.4]." Instead, it exhibits programs which are the implementations of algorithms and discusses them as if the algorithm is apparent. The reader is left with the challenge of learning to discriminate between what is essential about an algorithm, and how to preserve that in an implementation, versus what is inessential to the algorithm and introduced on account of the implementation and the use of particular programming tools.

I am concerned that this approach, while well-motivated, is not successful. My evidence is in the criticisms of this and later editions that dwell on the choice of programming language and on stylistic matters in the use of the chosen language. This places too much emphasis on code. Although code rules these days, I remain unconvinced that this simplification is a good thing. For me, one of the great insights in development of software is identification of layers of abstraction for conquering the organization of complex application programs. Separating design, algorithm and implementation is a critical first step toward that mastery.

Meanwhile, "Algorithms" serves up a handy set of recipes for a variety of basic computing situations. The 45 sections cover fundamental methods of widespread application in computing and software development. The presentations are straightforward and illuminating. The compilation bears re-examination every time one sits down to identify key methods for a new application.

I recommend supplementing this material with the practical methods of Kernighan and Plauger's "Software Tools" and the insightful explorations of Bentley's "Programming Pearls." Most of all I encourage development of enough sense of the material in Donald Knuth's "Art of Computer Programming" to be able to read the discussions of algorithms and problems there, even if you never use the particular implementations.

4 of 4 people found the following review helpful:

5.0 out of 5 stars Good introductory text, October 14, 2004

By	Bjørn Borud (Trondheim, Norway) - See all my reviews (REAL NAME)

This review is from: Algorithms (Hardcover)

I found this book at a university book shop back when I was 14 years old and bought it to learn more about certain algorithms. The reason I bought it was because it looked like it would provide very concrete advice on how to achieve an implementation while not requiring more advanced mathematics than I knew at the time.

Now, many years later I have to say that I can't think of any algorithm book I've come across that manages to balance theory and concrete solutions so well; and I own quite a few books on algorithms. (Some might object to the fact that the book uses Pascal as the implementation language, but I think I've seen this book tailored for other languages too).

Also, for a general book on algorithms, Sedgewick managed to pick a very good mix of topics to cover. According to a friend of mine (whom happens to know Sedgewick personally), the book just represents a cross-section of what Sedgewick himself was interested in.

This book was very useful to me when I was a teenager starting to understand bread and butter algorithms, and it continues to be a good reference still to this day. I would recommend you buy this book if you need a good book on fundamental algorithms.

(Also, the typography is very sober and clean, and the illustrations to most of the problems are very clear)