Pub Date: July 23, 2002
, 768 pages
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 tutorial distinctive.-William A. Ward, University of South Alabama
This version 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 apps.
Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous versions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third version 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 tutorial, 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 apps. Although the substance of the tutorial applies to coding in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.
Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new coding styles with classic and new algorithms, you will find a wealth of useful information in this tutorial.Comments