- 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,851,784 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.
See the Best Books of 2017
Looking for something great to read? Browse our editors' picks for the best books of the year in fiction, nonfiction, mysteries, children's books, and much more.
Frequently bought together
Customers who viewed this item also viewed
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.
Author interviews, book reviews, editors picks, and more. Read it now
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Cormen is an introduction to a lot of different types of algorithms.
Skiena presents a practical guide on applying algorithms.
Sedgewick is about very clean, easy to understand + memorize implementations of standard algorithms. I think the implementations in this book are some of the most beautiful and terse programs around. One thing that's initially a bit off putting is the sheer number of words that accompany each example, but I've found that the very in depth explanations are actually quite good ... after you've had some time to sit and play with the examples first. If you're willing to put in the effort, the text is actually really quite accessible. You do have to attack each example for a while before you start to feel like you're on the same wavelength as the author, but only because the material itself requires it, not because the text is difficult to understand.
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.