It looks like you're offline.

An edition of Data structures & algorithms in Java (2003)

Data structures & algorithms in Java

2nd ed.

by Robert Lafore

★★★★ 4.0 (1 rating)
33 Want to read
1 Currently reading
1 Have read

Cover of: Data structures & algorithms in Java by Robert Lafore, Robert Lafore

My Reading Lists:

Use this Work

Create a new list

★★★★ 4.0 (1 rating)
33 Want to read
1 Currently reading
1 Have read

Check nearby libraries

WorldCat

Buy this book

Last edited by Drini

September 13, 2025 | History

Edit

An edition of Data structures & algorithms in Java (2003)

Data structures & algorithms in Java

2nd ed.

by Robert Lafore

★★★★ 4.0 (1 rating)
33 Want to read
1 Currently reading
1 Have read

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.

Publish Date

2003

Publisher

Sams

Language

English

Pages

776

Check nearby libraries

WorldCat

Buy this book

Previews available in: English

Edition	Availability
1 Data Structures and Algorithms in Java 2017, Pearson Education, Limited in English 0134847997 9780134847993	zzzz Locate
2 Data Structures and Algorithms in Java 2005, Pearson Education Electronic resource in English 0768662605 9780768662603	zzzz Locate
3 Data structures & algorithms in Java 2003, Sams in English - 2nd ed. 0672324539 9780672324536	aaaa Preview Only

Add another edition?

Book Details

Table of Contents

What's New in the Second Edition

Additional Topics

End-of-Chapter Questions

Programming Projects

What This Book Is About

What's Different About This Book

Easy to Understand

Workshop Applets

Java Example Code

Who This Book Is For

What You Need to Know Before You Read This Book

The Software You Need to Use This Book

How This Book Is Organized

Enjoy Yourself!

What Are Data Structures and Algorithms Good For?

Real-World Data Storage

Programmer's Tools

Real-World Modeling

Overview of Data Structures

Overview of Algorithms

Some Definitions

Object-Oriented Programming

Problems with Procedural Languages

Objects in a Nutshell

A Runnable Object-Oriented Program

Inheritance and Polymorphism

Software Engineering

Java for C++ Programmers

Overloaded Operators

Primitive Variable Types

Java Library Data Structures

The Array Workshop Applet

The Duplicates Issue

The Basics of Arrays in Java

Creating an Array

Accessing Array Elements

An Array Example

Dividing a Program into Classes

Classes LowArray and LowArrayApp

Class Interfaces

Not So Convenient

Who's Responsible for What?

The highArray.java Example

The User's Life Made Easier

The Ordered Workshop Applet

Java Code for an Ordered Array

Binary Search with the find() Method

The OrdArray Class

Advantages of Ordered Arrays

The Opposite of Raising Two to a Power

Storing Objects

The Person Class

The classDataArray.java Program

Insertion in an Unordered Array: Constant

Linear Search: Proportional to N

Binary Search: Proportional to log(N)

Don't Need the Constant

Why Not Use Arrays for Everything?

Programming Projects

3. Simple Sorting

How Would You Do It?

Bubble Sort on the Baseball Players

The BubbleSort Workshop Applet

Java Code for a Bubble Sort

Efficiency of the Bubble Sort

Selection Sort on the Baseball Players

The SelectSort Workshop Applet

Java Code for Selection Sort

Efficiency of the Selection Sort

Insertion Sort on the Baseball Players

The InsertSort Workshop Applet

Java Code for Insertion Sort

Invariants in the Insertion Sort

Efficiency of the Insertion Sort

Sorting Objects

Java Code for Sorting Objects

Lexicographical Comparisons

Comparing the Simple Sorts

Programming Projects

4. Stacks and Queues

A Different Kind of Structure

Programmer's Tools

Restricted Access

The Postal Analogy

The Stack Workshop Applet

Java Code for a Stack

Stack Example 1: Reversing a Word

Stack Example 2: Delimiter Matching

Efficiency of Stacks

The Queue Workshop Applet

A Circular Queue

Java Code for a Queue

Efficiency of Queues

Priority Queues

The PriorityQ Workshop Applet

Java Code for a Priority Queue

Efficiency of Priority Queues

Parsing Arithmetic Expressions

Postfix Notation

Translating Infix to Postfix

Evaluating Postfix Expressions

Programming Projects

5. Linked Lists

References and Basic Types

Relationship, Not Position

The LinkList Workshop Applet

The Insert Button

The Find Button

The Delete Button

A Simple Linked List

The LinkList Class

The insertFirst() Method

The deleteFirst() Method

The displayList() Method

The linkList.java Program

Finding and Deleting Specified Links

The find() Method

The delete() Method

Double-Ended Lists

Linked-List Efficiency

Abstract Data Types

A Stack Implemented by a Linked List

A Queue Implemented by a Linked List

Data Types and Abstraction

ADTs as a Design Tool

Java Code to Insert an Item in a Sorted List

The sortedList.java Program

Efficiency of Sorted Linked Lists

List Insertion Sort

Doubly Linked Lists

The doublyLinked.java Program

Doubly Linked List as Basis for Deques

A Reference in the List Itself?

An Iterator Class

Additional Iterator Features

Iterator Methods

The interIterator.java Program

Where Does the Iterator Point?

The atEnd() Method

Iterative Operations

Programming Projects

Triangular Numbers

Finding the nth Term Using a Loop

Finding the nth Term Using Recursion

The triangle.java Program

What's Really Happening?

Characteristics of Recursive Methods

Is Recursion Efficient?

Mathematical Induction

A Recursive Binary Search

Recursion Replaces the Loop

Divide-and-Conquer Algorithms

The Towers of Hanoi

The Towers Workshop Applet

Moving Subtrees

The Recursive Algorithm

The towers.java Program

Merging Two Sorted Arrays

Sorting by Merging

The MergeSort Workshop Applet

The mergeSort.java Program

Efficiency of the Mergesort

Eliminating Recursion

Recursion and Stacks

Simulating a Recursive Method

What Does This Prove?

Some Interesting Recursive Applications

Raising a Number to a Power

The Knapsack Problem

Combinations: Picking a Team

Programming Projects

7. Advanced Sorting

Insertion Sort: Too Many Copies

Diminishing Gaps

The Shellsort Workshop Applet

Java Code for the Shellsort

Other Interval Sequences

Efficiency of the Shellsort

The Partition Workshop Applet

The partition.java Program

The Partition Algorithm

Efficiency of the Partition Algorithm

The Quicksort Algorithm

Choosing a Pivot Value

The QuickSort1 Workshop Applet

Degenerates to O(N^2) Performance

Median-of-Three Partitioning

Handling Small Partitions

Removing Recursion

Efficiency of Quicksort

Algorithm for the Radix Sort

Designing a Program

Efficiency of the Radix Sort

Programming Projects

8. Binary Trees

Why Use Binary Trees?

Slow Insertion in an Ordered Array

Slow Searching in a Linked List

Trees to the Rescue

What Is a Tree?

Tree Terminology

How Do Binary Search Trees Work?

The Binary Tree Workshop Applet

Representing the Tree in Java Code

Using the Workshop Applet to Find a Node

Java Code for Finding a Node

Tree Efficiency

Inserting a Node

Using the Workshop Applet to Insert a Node

Java Code for Inserting a Node

Traversing the Tree

Inorder Traversal

Java Code for Traversing

Traversing a Three-Node Tree

Traversing with the Workshop Applet

Preorder and Postorder Traversals

Finding Maximum and Minimum Values

Deleting a Node

Case 1: The Node Has No Children

Case 2: The Node Has One Child

Case 3: The Node Has Two Children

The Efficiency of Binary Trees

Trees Represented as Arrays

The Complete tree.java Program

The Huffman Code

Character Codes

Decoding with the Huffman Tree

Creating the Huffman Tree

Coding the Message

Creating the Huffman Code

Programming Projects

9. Red-Black Trees

Our Approach to the Discussion

Top-Down Insertion

Balanced and Unbalanced Trees

Degenerates to O(N)

Balance to the Rescue

Red-Black Tree Characteristics

Fixing Rule Violations

Using the RBTree Workshop Applet

Clicking on a Node

The Start Button

The Flip Button

Where's the Find Button?

Experimenting with the Workshop Applet

Experiment 1: Inserting Two Red Nodes

Experiment 2: Rotations

Experiment 3: Color Flips

Experiment 4: An Unbalanced Tree

More Experiments

The Red-Black Rules and Balanced Trees

Simple Rotations

The Weird Crossover Node

Subtrees on the Move

Human Beings Versus Computers

Inserting a New Node

Preview of the Insertion Process

Color Flips on the Way Down

Rotations After the Node Is Inserted

Rotations on the Way Down

The Efficiency of Red-Black Trees

Red-Black Tree Implementation

Other Balanced Trees

10. 2-3-4 Trees and External Storage

Introduction to 2-3-4 Trees

What's in a Name?

2-3-4 Tree Organization

Searching a 2-3-4 Tree

Splitting the Root

Splitting on the Way Down

The Tree234 Workshop Applet

The Fill Button

The Find Button

The Zoom Button

Viewing Different Nodes

Java Code for a 2-3-4 Tree

The DataItem Class

The Tree234 Class

The Tree234App Class

The Complete tree234.java Program

2-3-4 Trees and Red-Black Trees

Transformation from 2-3-4 to Red-Black

Operational Equivalence

Efficiency of 2-3-4 Trees

Storage Requirements

External Storage

Accessing External Data

Sequential Ordering

Complex Search Criteria

Sorting External Files

Programming Projects

11. Hash Tables

Introduction to Hashing

Employee Numbers as Keys

Open Addressing

Java Code for a Linear Probe Hash Table

Quadratic Probing

Separate Chaining

The HashChain Workshop Applet

Java Code for Separate Chaining

Quick Computation

Non-Random Keys

Hashing Strings

Hashing Efficiency

Open Addressing

Separate Chaining

Open Addressing Versus Separate Chaining

Hashing and External Storage

Table of File Pointers

Non-Full Blocks

Programming Projects

Introduction to Heaps

Priority Queues, Heaps, and ADTs

Not Really Swapped

The Heap Workshop Applet

The Fill Button

The Change Button

The Remove Button

The Insert Button

Java Code for Heaps

The heap.java Program

Expanding the Heap Array

Efficiency of Heap Operations

A Tree-based Heap

Trickling Down in Place

Using the Same Array

The heapSort.java Program

The Efficiency of Heapsort

Programming Projects

Introduction to Graphs

Historical Note

Representing a Graph in a Program

Adding Vertices and Edges to a Graph

The Graph Class

Depth-First Search

Breadth-First Search

Minimum Spanning Trees

GraphN Workshop Applet

Java Code for the Minimum Spanning Tree

The mst.java Program

Topological Sorting with Directed Graphs

An Example: Course Prerequisites

Directed Graphs

Topological Sorting

The GraphD Workshop Applet

Cycles and Trees

Connectivity in Directed Graphs

The Connectivity Table

Warshall's Algorithm

Implementation of Warshall's Algorithm

Programming Projects

14. Weighted Graphs

Minimum Spanning Tree with Weighted Graphs

An Example: Cable TV in the Jungle

The GraphW Workshop Applet

Send Out the Surveyors

Creating the Algorithm

The mstw.java Program

The Shortest-Path Problem

The Railroad Line

Dijkstra's Algorithm

Agents and Train Rides

Using the GraphDW Workshop Applet

The path.java Program

The All-Pairs Shortest-Path Problem

Intractable Problems

The Knight's Tour

The Traveling Salesman Problem

Hamiltonian Cycles

Programming Projects

15. When to Use What

General-Purpose Data Structures

Speed and Algorithms

Binary Search Trees

Comparing the General-Purpose Storage Structures

Special-Purpose Data Structures

Comparison of Special-Purpose Structures

External Storage

Sequential Storage

Appendixes

A. Running the Workshop Applets and Example Programs

The Workshop Applets

The Example Programs

The Sun Microsystem's Software Development Kit

Command-line Programs

Setting the Path

Viewing the Workshop Applets

Operating the Workshop Applets

Running the Example Programs

Compiling the Example Programs

Editing the Source Code

Terminating the Example Programs

Multiple Class Files

Other Development Systems

B. Further Reading

Data Structures and Algorithms

Object-Oriented Programming Languages

Object-Oriented Design and Software Engineering

C. Answers to Questions

Chapter 1, Overview — Answers to Questions

Chapter 2, Arrays — Answers to Questions

Chapter 3, Simple Sorting — Answers to Questions

Chapter 4, Stacks and Queues — Answers to Questions

Chapter 5, Linked Lists — Answers to Questions

Chapter 6, Recursion — Answers to Questions

Chapter 7, Advanced Sorting — Answers to Questions

Chapter 8, Binary Trees — Answers to Questions

Chapter 9, Red-Black Trees — Answers to Questions

Chapter 10, 2-3-4 Trees and External Storage — Answers to Questions

Chapter 11, Hash Tables — Answers to Questions

Chapter 12, Heaps — Answers to Questions

Chapter 13, Graphs — Answers to Questions

Chapter 14, Weighted Graphs — Answers to Questions

Edition Notes

Includes bibliographical references (p. [735]-737) and index.
Rev. ed. of Sams teach yourself data structures and algorithms in 24 hours, 1999.

Published in: Indianapolis, Ind

Classifications

Dewey Decimal Class: 005.7/3
Library of Congress: QA76.9.D35 L355 2003, QA76.9.D35L34 2002

The Physical Object

Pagination: xix, 776 p. :
Number of pages: 776

Edition Identifiers

Open Library: OL3573553M
ISBN 10: 0672324539
LCCN: 2002106907
OCLC/WorldCat: 51256595
LibraryThing: 1415923
Goodreads: 300092

Work Identifiers

Work ID: OL2036110W

Source records

Internet Archive item record
Internet Archive item record
Better World Books record
Library of Congress MARC record
ISBNdb
Harvard University record

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Created April 1, 2008
17 revisions

Download catalog record: RDF / JSON / OPDS | Wikipedia citation

September 13, 2025	Edited by Drini	Add TOC from Tocky
September 13, 2025	Edited by Drini	Add TOC from Tocky
December 8, 2024	Edited by MARC Bot	import existing book
December 19, 2023	Edited by ImportBot	import existing book
April 1, 2008	Created by an anonymous user	Imported from Scriblio MARC record