Data Structures and Algorithms in Java

Front Cover
Sams Publishing, Sep 6, 2017 - Computers - 800 pages

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 even more useful.

Educational Supplement

Suggested solutions to the programming projects found at the end of each chapter are made available to instructors at recognized educational institutions. This educational supplement can be found at www.prenhall.com, in the Instructor Resource Center.

 

Selected pages

Contents

Introduction
Table of Contents
Whats Different About This Book
Overview
Arrays
Arrays
Simple Sorting
Stacks and Queues
RedBlack Trees
234 Trees and External Storage
Hash Tables
Heaps
Graphs
Weighted Graphs
When to Use What
A Running the Workshop Applets and Example Programs

Linked Lists
Recursion
Advanced Sorting
Binary Trees
B Further Reading
Answers to Questions
Index
Copyright

Other editions - View all

Data Structures & Algorithms in Java
Mitchell Waite,Robert Lafore
No preview available - 1998
Data Structures & Algorithms in Java
Lafore
No preview available - 2003
Data Structures & Algorithms in Java
Robert Lafore
No preview available - 2003

Common terms and phrases

algorithm args arr.display B-tree Big O notation binary search tree binary tree bubble sort button C>java called cell Chapter color flip constructor create the array current.next data items data structures dData delete disk display doubly linked list element empty end class end main for(int j=0 getInt getString hash table hashVal Here’s infix inOrder insertion sort int maxSize iterator j<nElems Java Java Code key value Last name left child linked list loop lowerBound merge mergesort method move nElems newLink node null number of items object operations output parent partition pivot postfix priority queue private int public int public static void public void quadratic probe quicksort recursive red-black tree right child root rotation run this program searchKey selection sort sequence Shellsort shown in Figure split Stack bottom-->top static void main(String String subarray subtree successor swap System.out.println temp throws IOException upperBound view code image Workshop applet

About the author (2017)

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 and Object-Oriented Programming in 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.

Bibliographic information

TitleData Structures and Algorithms in Java
AuthorRobert Lafore
Edition2, reprint
PublisherSams Publishing, 2017
ISBN0134847997, 9780134847993
Length800 pages
Subjects ›  › 

Computers / Languages / Java
  
Export CitationBiBTeX EndNote RefMan