Addison-Wesley / Prentice Hall
Computer Science
My Instructor Resource Center : Log in or request access
Algorithms in Java, Parts 1-4, 3/E
ISBN-10: 0201361205
ISBN-13: 9780201361209
Publisher: Addison-Wesley Professional
Copyright: 2003
Format: Paper; 768 pp
Published: 07/23/2002
Status: Instock
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 (ADTs) and object-oriented programming. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1,000 new exercises to help students learn the properties of algorithms.
I. FUNDAMENTALS.
II. DATA STRUCTURES.
III. SORTING.
IV. SEARCHING.
View a Sample Chapter PDF:/samplechapter/0201361205.pdf
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.
0201361205AB06262002
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.
- 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.
0201361205B08282002
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, browse our available packages below, or contact your Pearson Higher Education representative to create your own package.
Package ISBN-10: 0201775786 | ISBN-13: 9780201775785
©2004 | Instock
Suggested retail price: $109.99 Buy from myPearsonStore
This package contains:
Sedgewick | ©2004 | Addison-Wesley Professional | Paper; 528 pp
