What do you think?
Rate this book
Algorithms in Java, Parts 1-4, Portable Documents
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.
Highlights 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.
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.
Highlights 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.
764 pages, Kindle Edition
First published January 1, 2002
14 people are currently reading
140 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 6 of 6 reviews
August 22, 2012
Highly recommended for anyone with interest in algorithms. While not quite as good as Sedgewick's original work with implementations in C++ this is recommended the ones most familiar with Java
February 8, 2022
Not related to Java. It just uses java as pseudocode. Does not even mention java data structures. From the title was expecting more practical book, not just typical algorithm reference...
April 1, 2013
oh god, most frustrating reading experience in my life, only my teacher (who went to princeton and took Sedgewick's class as an undergrad, and is every bit a geek as his prof) can understand this guy and would choose his book as the textbook for the class; that being said, if you are fast and have a good understanding of java, you should be able to get the hang of the gist of this book pretty quickly, and see that Sedgewick is a smart guy, but the problem is, if you had the knowledge that allows you to understand this book easily, you wouldn't be able to learn much from it; so, as a textbook for lower division computer science classes, this book is really not a good choice
January 13, 2010
An acceptable overview of basic algorithms and data structures, but a poor application of those in the Java development platform.
March 15, 2011
MEH. It has everything it needs to have, but boy the code sure is unnecessarily hard to parse, and the writing is only so-so.
July 4, 2015
Not bad, if you need to quickly review for a silicon valley interview. The 2nd volume (Part 5) on Graph algorithms is more interesting.
Displaying 1 - 6 of 6 reviews