Algorithms

by Robert Sedgewick and Kevin Wayne

Book Overview

The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0201066734
• ISBN13: 9780201066739
• Release Date: January 1988
• Publisher: Addison Wesley Publishing Company
• Length: 657 Pages
• Weight: 2.30 lbs.
• Dimensions: 1.3" x 6.7" x 9.6"

Customer Reviews

Good introductory text

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)

A classic when looking for information about algorithms

When having to solve problems regarding algorithms, this book is one of the frequently used books. It shows besides the interesting details also the larger overview, which certainly adds to your better understanding.

Can Programs Teach Algorithms?

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.

Excellent text on basic algorithms - too bad it's Pascal

This text covers the most useful material presented in Knuth's seminal series, but is much more readable in Pascal than in Knuth's notation, which was based on programming language concepts of the late 60's.The example code is actually run by the typesetting system to generate the graphs showing the operation or efficiency of the algorithm, so you have a high confidence factor in the example code. Too bad it's in Pascal -- which is probably why this book is out of print.I was very surprised at the low ratings awarded by reviewers to the paperback edition of Sedgewick's "Algorithms in C" -- yet there were good reviews of the hardcover edition. Evidently the example C code didn't meet the high standards of the Pascal version.

My favorite introduction to algorithms

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!