Data Structures and Algorithms in Java

Robert Lafore

796 pages, parution le 28/01/2003 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book more useful to readers.

Contents

Overview
Arrays
Simple Sorting
Stacks and Queues
Linked Lists
Recursion
Advanced Sorting
Binary Trees
Red-Black Trees
2-3-4 Trees and External Storage
Hash Tables
Heaps
Graphs
Weighted Graphs
When to Use What

Appendix A. Running the Workshop Applets and Example Programs
Appendix B. Further Reading
Appendix C. Answers to Questions

L'auteur - Robert Lafore

Robert Lafore has degrees in Electrical Engineering and Mathematics, 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 PC and XT, and (back at the beginning of the computer revolution) Soul of CP/M.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Sams
Auteur(s)	Robert Lafore
Parution	28/01/2003
Édition	2^eme édition
Nb. de pages	796
Format	19,5 x 24
Couverture	Relié
Poids	1489g
Intérieur	Noir et Blanc
EAN13	9780672324536
ISBN13	978-0-672-32453-6