數據結構 pdf epub mobi txt 電子書 下載2025

想要找書就要到 小美書屋

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

本書係統地講述瞭各種常用的數據結構，對基本概念、基本原理和基本方法進行瞭深入淺齣的介紹，同時對相關的算法設計也進行瞭詳細的講解。本書的一大特點就是采用非常流行的麵嚮對象程序設計語言Java作為算法描述語言，將傳統的數據結構與麵嚮對象技術完美結閤，更加自然貼切，易於理解。

　　本書第3版結閤Java 5.0進行瞭改進，增加瞭一些新內容，包括：泛型和枚舉數據類型，數組、集閤以及枚舉類型中使用的for循環的新形式，用於原始值與封裝器之間轉換的autoboxing和unboxing，帶有可變參數的方法，輸入/輸齣特性，Java子類型和協變返迴值。

本書特色

　　● 各個主題的順序非常靈活，教師可以根據課程需要自行選擇。

　　● 講述如何基於Java類庫規範，設計、實現和使用類。

　　● 討論編程技巧、陷阱警告和錯誤警告，突齣Java的細微之處。

　　● 使用一緻的五步方法介紹數據類型：抽象理解數據類型，編寫規格說明，使用數據類型，設計和實現數據類型，分析實現。

　　● 介紹如何編寫Java Applet來測試新實現的數據結構。

Michael Main 於華盛頓州立大學獲得博士學位，目前為科羅攔多大學計算機科學係副教授。

CHAPTER 1 The Phases of Software Development
1.1 Specification, Design, Implementation
1.2 Running Time Analysis.
1.3 Testing and Debugging
Chapter Summary and Solutions
CHAPTER 2 Java Classes and Information Hiding
2.1 Classes and Their Members
2.2 Using a Class
2.3 Packages
2.4 Parameters, Equals Methods, and Clones
Chapter Summary, Solutions and Projects
CHAPTER 3 Collection Classes
3.1 A Review of Java Arrays
3.2 An ADT for a Bag of Integers
3.3 Programming Project: The Sequence ADT
3.4 Programming Project: The Polynomial
Chapter Summary, Solutions and Projects
CHAPTER 4 Linked Lists
4.1 Fundamentals of Linked Lists
4.2 Methods for Manipulating Nodes
4.3 Manipulating an Entire Linked List
4.4 The Bag ADT with a Linked List
4.5 Programming Project: The Sequence ADT with a Linked List
4.6 Beyond Simple Linked Lists
Chapter Summary, Solutions and Projects
CHAPTER 5 Generic Programming
5.1 Java's Object Type
5.2 Object Methods and Generic Methods
5.3 Generic Classes
5.4 Generic Nodes
5.5 Interfaces and Iterators
5.6 A Generic Bag Class That Implements the Iteraable Interface (Optional Section).
5.7 Introduction to the Java Collection and Map Interlaces (Optional Section)
Chapter Summary, Solutions and Projects
CHAPTER 6 Stacks
6.1 Introduction to Stacks
6.2 Stack Applications
6.3 Implementations of the Stack ADT
6.4 More Complex Stack Applications
Chapter Summary, Solutions and Projects
CHAPTER 7 Queues
7.1 Introduction to Queues
7.2 Queue Applications
7.3 Implementations of the Queue ADT
7.4 Priority Queues..
Chapter Summary, Solutions and Projects
CHAPTER 8 Recursive Thinking
8.1 Recursive Methods
8.2 Studies of Recursion: Fractals and Mazes
8.3 Reasoning about Recursion
Chapter Summary, Solutions and Projects
CHAPTER 9 Trees
9.1 Introduction to Trees
9.2 Tree Representations
9.3 A Class for Binary Tree Nodes
9.4 Tree Traversals
9.5 Binary Search Trees
Chapter Summary, Solutions and Projects
CHAPTER 10 Tree Projects
10.1 Heaps
10.2 B-Trees
10.3 Java Support for Trees
10.4 Trees, Logs, and Time Analysis
Chapter Summary, Solutions and Projects
CHAPTER 11 Searching
11.1 Serial Search and Binary Search
11.2 Open-Address Hashing
11.3 Using Java's Hashtable Class
11.4 Chained Hashing
11.5 Time Analysis of Hashing
Chapter Summary, Solutions and Projects
CHAPTER 12 Sorting
12.1 Quadratic Sorting Algorithms
12.2 Recursive Sorting Algorithms
12.3 An O(n log n) Algorithm Using a Heap
Chapter Summary, Solutions and Projects
CHAPTER 13 Software Reuse wilh Extended Classes
13.1 Extended Classes
13.2 Generic Type Parameters and Inheritance
13.3 Simulation of an Ecosystem
13.4 Abstract Classes and a Game Class
Chapter Summary, Further Reading, Solutions and Projects
CHAPTER 14 Graphs
14.1 Graph Definitions
14.2 Graph Implementations
14.3 Graph Traversals
14.4 Path Algorithms
Chapter Summary, Solutions and ProjectsAPPENDIXES
A. Java's Primitive Types and Arithmetic Overflow
B. Java Input and Output
C. Throwing and Catching Java Exceptions
D. ArrayList, Vector, Hashtable, and HashMap Classes
E. A Class for Nodes in a Linked List
F A Class for a Bag of Objects
G. Further Big-O Notation
H. Javadoc
I. Applets for Interactive Testing
INDEX
· · · · · · (收起)