本书是国外数据结构与算法分析方面的标准教材,使用***的Java编程语言作为实现工具讨论了数据结构(组织大量数据的方法)和算法分析(对算法运行时间的估计)。 随着计算机速度的不断增加和功能的日益强大,人们对有效编程和算法分析的要求也在增长。本书把算法分析与*有效率的Java程序的开发有机地结合起来,深入分析每种算法,内容全面、缜密严格,并细致讲解精心构造程序的方法。
第2版的特色如下:
全面阐述新的Java 5.O编程语言和Java Collections库。 改进内部设计,用图和实例阐述算法的实施步骤。
第3章对表、栈和队列的讨论进行了全面修订。
用一章专门讨论摊还分析和一些**数据结构的实现。
每章末尾的大量练习按照难易程度编排,以增强对关键概念的理解。

Preface vii
Chapter 1 Introdudion
1.1 What's the Book About?
1.2 Mathematics Review
1.2.1 Exponents
1.2.2 Logarithms
1.2.3 Series
1.2.4 Modular Arithmetic
1.2.5 The P Word
1.3 A Brief Introduction to Recursion
1.4 Implementing Generic Components Pre Java 5
1.4.1 Using Object for Genericity
1.4.2 Wrappers for Primitive Types
1.4.3 Using Interface Types for Genericity
1.4.4 Compatibility of Array Types
1.5 Implementing Generic Components Using Java 5 Generics
1.5.1 Simple Generic Classes and Interfaces
1.5.2 Autoboxing/Unboxing
1.5.3 Wildcards with Bounds
1.5.4 Generic Static Methods
1.5.5 Type Bounds
1.5.6 Type Erasure
1.5.7 RestrictiOns on Generics
1.6 Function Objects
Summary
Exercises
References
Chapter 2 Algorithm Analysis
2.1 Mathematical Background
2.2 Model
2.3 What to Analyze
2.4 Running Time Calculations
2.4.1 A Simple Example
2.4.2 General Rules
2.4.3 Solutions for the Maximum Subsequence Sum Problem
2.4.4 Logarithms in the Running Time
2.4.5 Checking Your Analysis
2.4.6 A Grain of Salt
Summary
Exercises
References
Chapter 3 Lists, Stacks, and Queues
3.1 Abstract Data Types (ADTs)
3.2 The List ADT
3.2.1 Simple Array Implementation of Lists
3.2.2 Simple Linked Lists
3.3 Lists in the Java Collections API
3.3.1 Collection Interface
3.3.2 Iterators
3.3.3 The List Interface, ArrayList, and LinkedList
3.3.4 Example: Using remove on a LinkedList
3.3.5 ListIterators
3.4 Implementation of ArrayList
3.4.1 The Basic Class
3.4.2 The Iterator and Java Nested and Inner Classes
3.5 Implementation of LinkedList
3.6 The Stack ADT
3.6.1 Stack Model
3.6.2 Implementation of Stacks
3.6.3 Applications
3.7 The Queue ADT
3.7.1 Queue Model
3.7.2 Array Implementation of Queues
3.7.3 Applications of Queues
Summary
Exercises
Chapter 4 Trees
Chapter 5 Hashing
Chapter 6 Priority Queues (Heaps)
Chapter 7 Sorting
Chapter 8 The Disjoint Set Class
Chapter 9 Graph Algorithms
Chapter 10 Algorithm Design Techniques
Chapter 11 Amortized Analysis
Chapter 12 Advanced Data Structures and Implementation
Index