- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Other titles in the Algorithms in Java series:
Algorithms in Java 3RD Edition Parts 1-4 Fundameby Robert Sedgewick
Synopses & Reviews
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.
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.
Book News Annotation:
This volume comprises a new edition of the first half of Sedgewick's (computer science, Princeton, U.) complete work. Sixteen chapters present Java class implementations of about 100 important practical algorithms, and address topics such as ADTs, modular, and object oriented programming; arrays, linked lists, trees, and other data structures; algorithms for sorting, selection, priority queue ADT implementations, and search algorithms; and implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway ties, and other advanced methods.
Annotation c. Book News, Inc., Portland, OR (booknews.com)
By blending theory and practice, this book appeals equally to both the academic and professional markets. For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. The author has developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications.
For the first time, Robert Sedgewick's popular textbook on algorithms and data structures is available in a Java version. Tim Lindholm (co-author of The Java Virtual Machine Specification) and Sedgewick have developed new Java implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADT's) and object-oriented programming. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1000 new exercises to help students learn the properties of algorithms.
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.
Table of Contents
v. 1. Parts 1-4: fundamentals, data structures, sorting, searching --
What Our Readers Are Saying
Other books you might like
Computers and Internet » Computer Languages » Java