- Hardcover: 992 pages
- Publisher: Addison-Wesley Professional; 4th edition (March 19, 2011)
- Language: English
- ISBN-10: 032157351X
- ISBN-13: 978-0321573513
- Product Dimensions: 7.5 x 1.4 x 9.3 inches
- Shipping Weight: 3.2 pounds (View shipping rates and policies)
- Average Customer Review: 217 customer reviews
- Amazon Best Sellers Rank: #14,219 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.
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
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
There was a problem filtering reviews right now. Please try again later.
Depending on how you get to this page, you can see one of three different books all presented as the same book.
(1) A new edition of Algorithms in C++, published in August 2013 -- search in books for the title and you will see the listing, "Algorithms in C++ by Robert Sedgewick (Aug 24, 2013)"
(2) An ancient edition of Algorithms in C, which is what you see if you click the "Look inside this book"
(3) A 2002 book, "Algorithms in C++ Part 5: Graph Algorithms (3rd Edition): Graph Algorithms Pt.5"
If you search for "Algorithms in C++", click the link for the 2013 version, and try to buy the Kindle edition, you end up with the 2002 graphs book.
Is there even a 2013 edition of Algorithms in C++? If you search for the same title on another book site, it looks like version with the cheesy graphics and blue cover is actually the 1992 edition.
I did not want to penalize any of the excellent Sedgewick books for Amazon's mistake so I made this a 5-star review.
It is really easy to read and the author showcases real-life usages of certain concepts frequently. There are pretty interesting algorithms as well, for instance, I did not know about any (near) other linear-complexity substring search algorithms, except Knuth's.
The layout of the book also makes it easy to follow.
I also liked the progression of the book; start with a common problem, solve it, expand on it and introduce more complex problems as we go along.
Most recent customer reviews
I will continue to adjust my review as i progress thorough the book.