Algorithms (4th Edition) 4th Edition
Use the Amazon App to scan ISBNs and compare prices.
- FREE return shipping at the end of the semester.
- Access codes and supplements are not guaranteed with rentals.
- List Price: $89.99
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.
Frequently bought together
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).
- Publisher : Addison-Wesley Professional; 4th edition (April 3, 2011)
- Language : English
- Hardcover : 976 pages
- ISBN-10 : 032157351X
- ISBN-13 : 978-0321573513
- Item Weight : 3.16 pounds
- Dimensions : 7.7 x 1.5 x 9.4 inches
- Best Sellers Rank: #34,994 in Books (See Top 100 in Books)
- Customer Reviews:
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
His treatment of 2-3 trees, Red-Black Trees is outstanding. In the first time in my life I understood the Regular Expressions. Not on a level of "what's it about", but on a level of "when I need to use them, I will no problem, I'll even implement all algorithms I need no problem with all the books closed".
That creates even a dissonance a little bit. Or a lot. As some topics in his exposition sound very boring, banal. It reads like he is stating obvious facts for no apparent reason as to fill the space and just "to cover" the topic for some formal reasons.
- Most of the chapters are not self-sufficient. Instead of conceptually pointing out what steps are required, the author send you to a specific, very specialized piece of code 5 chapters back or 3 chapters forward. Code is in Java. It's painful to read. Not because it's in Java, but because it's _implementation_ of a concept. Java is bad, too verbose, too specialized, etc.
- The programming language used in the book is Java. Java is a language for people who have no idea of what they are doing and have no business of writing algorithms. I believe any person who will write any algorithm will use C. Why Java then? Why not Logo? (Logo is a language where a turtle moves across the screen and kids give it some commands like "go forward 10 squares, turn 90")
Besides these cons, the author is definitely genius. 2-3 trees chapter and the Regular Expressions chapter are worth the price of the whole book. In gold.
However, the huge problem which makes me voting 4 star for the book is that some figures and illustrates are rendered badly (page 9, 675, 624, 621, 579, 576, 346, 326). Although I requested Amazon a replacement, the new book still has the same issue.
Top reviews from other countries
Very very well formatted that will actually help you to visualize the process/steps of a given algorithm. Coverage was good and you can really get the classic algorithms.
(1) Figures are hard to read, I cannot zoom in.
(2) Source code is formatted with weird line breaks, making it hard to read.
(3) Links on videos can be clicked, but result in "page not found" errors.
(4) Repeated references to "page x" in the text, which do not make sense in an e-book.
(5) Links for figures can be clicked, but do not lead to the referenced figure.
Overall, a poor job for a 40 Euro (!) e-book.