- Paperback: 1200 pages
- Publisher: Addison-Wesley Professional; 3 edition (August 1, 2003)
- Language: English
- ISBN-10: 0201775786
- ISBN-13: 978-0201775785
- Product Dimensions: 7.9 x 2.6 x 9.4 inches
- Shipping Weight: 4.4 pounds (View shipping rates and policies)
- Average Customer Review: 20 customer reviews
- Amazon Best Sellers Rank: #1,293,716 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.
Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) 3rd 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
About the Author
Robert Sedgewick is one of the most revered individuals in computer science. He is the William O. Baker Professor of Computer Science at Princeton University. He is a director of Adobe Systems and has held visiting research positions at INRIA, the Institute for Defense Analyses, and Xerox PARC. Michael Schidlowsky contributed to the Java implementations. Michael, a Princeton graduate, is an independent software consultant specializing in object-oriented programming. Most recently he was the CTO of Teaching That Works, and the founder of xSense Corporation.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Cons: Java code is a bit "C-ish" and makes it clear that it is easy to write C program in Java. In addition, section Geometric Algorithms from 1990 edition and other material following this section is missing in newer editions. Maybe this material will be included in Volume 3, that as rumor says, is in preparation.
However, the examples and code used in the book is impossible to follow. If you wish to implement any of the algorithms, you really just have to write the algorithm yourself - it may even be easier to write it from scratch without even looking at the authors examples. This is NOT a book to go to if you want to type up a given sorting algorithm to use for some purpose. The code is hard to follow due to horrible variable naming, references back to code from previous chapters, relies on code from previous chapters, relies on code that the reader is supposed to write as part of the exercises, etc.
I've been working on trying to get a running copy of my own for Radix sort typed up. I thought I would type up the code in this book. That's not working. I've been at it for a couple hours now and I still am jumping around trying to put together the bits of code scattered throughout the book and understand the variables.
So - this book is for people who are interested in studying and learning about the various algorithms, but not for people who learn best by examples. There is plenty to read on the algorithms and much discussion on how they work and when they work best, but trying to make sense out of the code examples is near impossible.