數據結構(Java語言版) 內容簡介
本書最大的特點是，首先定義了抽象數據類型（ADT），然後在此基礎上介紹了數據結構的各種概念和知識。這樣，讀者的注意力不是放在數據結構內部的具體實現，而是集中於其外在功能接口與特性，使讀者可以在較短的時間內學會如何使用Java語言本身提供的數據結構。本書的示例都只給出關鍵的語句而忽略細節部分，其原始碼可以從http://web.engr.oregonstate.edu/~budd/books/jds/下載，這不僅使得本書的結構緊湊、可讀性強，而且可以避免讀者對本書的依賴，養成獨立思考、勤於動手的習慣，有利於讀者對數據結構知識的理解和掌握。
本書可以作為大中專院校的數據結構教學用書。
數據結構(Java語言版) 本書目錄
1 THE MANAGEMENT OF COMPLEXITY1.1 The Control of Complexity
1.2 Abstraction, Information hiding, and Layering
1.3 Division into Parts
1.4 Composition
1.5 Layers of Specialization
1.6 Multiple Views
1.7 Patterns
1.8 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
2 ABSTRACT DATA TYPES
2.1 What Is a Type?
2.2 Abstract Data Types
2.3 The Fundamental ADTs
2.4 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
3 ALGORITHMS
3.1 Characteristics of Algorithms
3.2 Recipes as Algorithms
3.3 Analyzing Computer Algorithms
3.4 Recursive Algorithms
3.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
4 EXECUTION-TIME MEASUREMENT
4.1 Algorithmic Analysis and Big-Oh Notation
4.2 Execution Time of Programming Constructs
4.3 Summing Algorithmic Execution Times
4.4 The Importance of Fast Algorithms
4.5 Benchmarking Execution Times
4.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
5 INCREASING CONFIDENCE IN CORRECTNESS
5.1 Program Proofs
5.2 Program Testing
5.3 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
6 VECTORS
6.1 The Vector data structure
6.2 Enumeration
6.3 Application-Silly Sentences
6.4 Application-Memory Game
6.5 Application-Shell Sort
6.6 A Visual Vector
6.7 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
7 SORTING VECTORS
7.1 Divide and Conquer
7.2 SortedVectors
7.3 Merge Sort
7.4 Partitioning
7.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
8 LINKED LISTS
8.1 Varieties of Linked Lists
8.2 LISP-Style Lists
8.3 The LinkedList Abstraction
8.4 Application-Asteroids Game
8.5 Application-Infinite-Precision Integers
8.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
9 LIST VARIATIONS
……
10 STACKS
11 DEQUES
12. QuEuEs
13 TREES
14 BINARY SEARCH TREES
15 PRIORITY QUEUES
16 HASH TABLES
17 MAPS
18 SETS
19 MATRICES
20 GRAPHS
APPENDIX A JAVA SYNTAX
APPENDIX B IMPORT LIBRARIES
APPENDIX C DATA STRUCTURES IN THE JAVA STANDARD LIBRARY
BIBLIOGRAPHY
