- Hardcover: 992 pages
- Publisher: Addison-Wesley Professional; 4th edition (March 19, 2011)
- Language: English
- ISBN-10: 032157351X
- ISBN-13: 978-0321573513
- Product Dimensions: 7.6 x 1.4 x 9.3 inches
- Shipping Weight: 3.2 pounds
- Average Customer Review: 214 customer reviews
- Amazon Best Sellers Rank: #23,336 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Algorithms (4th Edition) 4th Edition
Use the Amazon App to scan ISBNs and compare prices.
This month's Book With Buzz: "The Lying Game" by Ruth Ware
From the instant New York Times bestselling author of blockbuster thrillers "In a Dark, Dark Wood" and "The Woman in Cabin 10" comes Ruth Ware’s chilling new novel, "The Lying Game." See more
Customers who bought this item also bought
Customers who viewed this item also viewed
About the Author
Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
Browse award-winning titles. See more
Top customer reviews
But what really impressed me was the code. This book shows the fundamental data structures and algorithms in just a few lines of beautiful and well-thought code. Sure, any nit-picker may find quibbles, but most choices are understandable from a didactic and printing perspective. This code is so much better than any in the old C++ book. The authors preferred clarity, yet the code is still concise. The authors are clear about feature creep, and limit their code to what is needed and no more, though some extensions are part of the exercises. I am reminded of the Einstein paraphrase "As simple as possible, but no simpler".
More complex data structures and algorithms need multiple code boxes, which are all explained in detail, with the box appearing close to the explanation. Some readers may take issue with the density of information in examples, but I find it advantageous to have all information close-by rather than spread out. I prefer to pore over their dense examples than having to flip pages.
If you're new to the study of algorithms, the trio of this book, its website, and the Coursera course are a potent combination for successful learning.
This is a more approachable alternative to the CLRS algorithms book.
Some of the explanations and code examples were a little overly complicated- Sorting was explained using a 15-20 letter phase instead of starting with a single word to make it easier to digest and them moving on to the more complex example. On most topics our prof explained the algorithms a little differently than the book and his way was easier to comprehend.
There's a few things I strongly dislike about this book--
1. The Java syntax is massively distracting. I'd rather have pseudocode.
2. The pages are glossy--a lot of books are doing this, but it causes reflections on the pages, which makes it more optically difficult to read. This is infuriating!
3. The index is fairly bad. For example, 'string matching' isn't in the index, but Knuth Morris Pratt IS in the index.
That said, I use this book often when working through new algorithm design when Cormen lets me down...but this is never my first go-to-book.
Most recent customer reviews
I will continue to adjust my review as i progress thorough the book.