- Paperback: 768 pages
- Publisher: Addison-Wesley Professional; 3 edition (August 2, 2002)
- Language: English
- ISBN-10: 0201361205
- ISBN-13: 978-0201361209
- Product Dimensions: 7.8 x 1.6 x 9.2 inches
- Shipping Weight: 2.6 pounds (View shipping rates and policies)
- Average Customer Review: 3.0 out of 5 stars See all reviews (8 customer reviews)
- Amazon Best Sellers Rank: #1,112,566 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 in Java, Parts 1-4 (3rd Edition) (Pts.1-4) 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
Titles for medical residents
Featured Lippincott resources for medical residents. See more
Frequently bought together
Customers who bought this item also bought
From the Back Cover
Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
--William A. Ward, University of South Alabama
This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.
Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 400,000 programmers!
This particular book, Parts 1-4 , represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.
- Java class implementations of more than 100 important practical algorithms
- Emphasis on ADTs, modular programming, and object-oriented programming
- Extensive coverage of arrays, linked lists, trees, and other fundamental data structures
- Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)
- Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods
- Quantitative information about the algorithms that gives you a basis for comparing them
- More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms
Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.
About the Author
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.
Browse award-winning titles. See more
If you are a seller for this product, would you like to suggest updates through seller support?
Top customer reviews
The analysis sections and graphics are nice. The little side tables are handy.
Here is an actual sentence from the book-
We construct a symbol table that is made up of an ordered array of keys, except that we keep in that array not the key, but an index into the text string that points to the first character of the key.
Consider that there are two possible conflicting meanings of the sentence fragment :
...an index into the text string that points to the first character of the key.
In the first meaning, there is an index that points to the first character of a string which string has the property that it, in its turn "points to the first character of the key". (a String is engaged in pointing and so in the index.)
In the second meaning, there is an index that points (into) a text string and in fact that index points into the FIRST CHARACTER of that text string, and that first character the index is pointing to, well, that is the also first character of the key. (only the index is pointing; the string pointeth not.)
OK so how do you describe what's missing here? At least the disambiguating use of commas, at least. It's as though he likes to write in subordinate clauses, but thinks it's economical to leave out the punctuation (which, it is true, there are no hard and fast rules for).
So it's just sentence after sentence after sentence like that. Sometimes you can understand what he's saying. Other times, really you just can't. IF each sentence has 2 (or more!) possible interpretations, and each sentence depends on your understanding the last (as is the case- he never says the same thing in two different ways), then you get this ambiguity growing at the alarming rate of x^2, an observation the author might enjoy.
As the other reviewers said, the code is a C programmers attempt to write in Java. This never goes well.....
But the fact remains it is still the most accessible and thorough coverage of some of its subjects. So what are you going to do?
I don't get the impression he is deliberately bartering in obscuratism, it's just that this book suffers (and so will you) from a lack of editing, a lack of reviewing and feedback by genuine, unaided learners etc. etc.
You might want to check other people's lists for alternatives. Or not. Perhaps that passage was perfectly clear to you.
This was a huge problem for me, as I had a lot of difficulty seeing a clear mapping from the concepts explained to the code examples. Sedgwick's code examples often build on previous ones to the degree that they are not understandable on their own (this is especially true with the graph algorithms in part 5). If you try to use this book as a reference you will find yourself digging much harder than you would like in order to understand code samples that are actually quite simple. You could see how this might make a programming based course difficult.
The best parts of the book are sorting and searching. A wide variety of algorithms are explained and demonstrated in detail. The code is solid and the writing is very good.
This is the set of Java algorithms books.
But seriously, this book is the reason I got started in computer science to begin with. Before I read the chapter on ternary search tries, my life was a mess. It was a real rat-infested cesspool! But this book helped to set me straight. Michael Schidlowsky is a role model to us all, as both a coder AND as a citizen.
Lest we forget the Zeus of the algorithmic Mt. Olympus, Robert "Dr. Bob" Sedgewick! He will forever stand like a pillar, nay, a BEACON of mathematical intuition and prowess. Welcome to the jungle, my friends; it gets worse here every day.