Data Structures & Algorithms in Java by Robert Lafore Sams © 1998, 617 pages
Beautifully written and illustrated, this book introduces you to manipulating data in practical ways using Java examples.
Table of Contents Back Cover
Synopsis by Rebecca Rohan Once you've learned to program, you run into real-world problems that requiremore than a programming language alone to solve. Data Structures and Algorithms in Java is a gentle immersion into the most practical ways to make data do what you want it to do. Lafore's relaxed mastery of the techniques comes through as though he's chatting with the reader over lunch, gesturing toward appealing graphics. The book starts at the very beginning with data structures and algorithms,but assumes the reader understands a language such as Java or C++. Examples are given in Java to keep them free of explicit pointers.
Table of Contents Data Structures and Algorithms in Java - 4 Introduction - 7
Chapter 1 Chapter 2 Chapter 3
- Overview - 11 - Arrays - 29 - Simple Sorting - 63 - Stacks and Queues - 80 - Linked Lists - 142 - Recursion - 200 - AdvancedSorting - 243 - Binary Trees - 280 - Red-Black Trees - 311
Chapter 4 Chapter 5 Chapter 6
Chapter 7 Chapter 8 Chapter 9
Chapter 10 - 2-3-4 Trees and External Storage - 335 Chapter 11 - Hash Tables - 372 Chapter 12 - Heaps - 416
Chapter 13 - Graphs - 438 Chapter 14 - Weighted Graphs - 476 Chapter 15 - When to Use What - 510
Part VI Appendixes
Appendix A -How to Run the Workshop Applets and Example Programs - 521 Appendix B - Further Reading - 524
Back Cover • • • • • Data Structures and Algorithms in Java, by Robert Lafore (The Waite Group, 1998) "A beautifully written and illustrated introduction to manipulating data in practical ways, using Java examples." Designed to be the most easily understood book ever written on data structures andalgorithms Data Structures and Algorithms is taught with "Workshop Applets+ animated Java programs that introduce complex topics in an intuitively obvious way The text is clear, straightforward, non-academic, and supported by numerous figures Simple programming examples are written in Java, which is easier to understand than C++ About the Author Robert Lafore has degrees in Electrical Engineering andMathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best-selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course, Object-
Oriented Programming in C++, and C Programming Using Turbo C++. Earlier best-selling titles include Assembly Language Primer for the IBM PCand XT and (back at the beginning of the computer revolution) Soul of CP/M.
Data Structures and Algorithms in Java
PUBLISHER: Mitchell Waite ASSOCIATE PUBLISHER: Charles Drucker EXECUTIVE EDITOR: Susan Walton ACQUISITIONS EDITOR: Susan Walton PROJECT DEVELOPMENT EDITOR: Kurt Stephan CONTENT EDITOR: Harry Henderson TECHNICAL EDITOR: Richard S. Wright, Jr. CONTENT/TECHNICALREVIEW: Jaime Niño, PhD, University of New Orleans COPY EDITORS: Jim Bowie, Tonya Simpson MANAGING EDITOR: Jodi Jensen INDEXING MANAGER: Johnna L. VanHoose EDITORIAL ASSISTANTS: Carmela Carvajal, Rhonda Tinch-Mize SOFTWARE SPECIALIST: Dan Scherf DIRECTOR OF BRAND MANAGEMENT: Alan Bower PRODUCTION MANAGER: Cecile Kaufman PRODUCTION TEAM SUPERVISOR: Brad Chinn COVER DESIGNER: Sandra Schroeder BOOKDESIGNER: Jean Bisesi
PRODUCTION: Mike Henry, Linda Knose, Tim Osborn, Staci Somers, Mark Walchle © 1998 by The Waite Group, Inc.® Published by Waite Group Press™ 200 Tamal Plaza, Corte Madera, CA 94925 Waite Group Press™ is a division of Macmillan Computer Publishing. All rights reserved. No part of this manual shall be reproduced, stored in a retrieval system, or transmitted by any means,...