Java数据结构与算法分析
2004-1
科学出版社
马克·艾伦·威丝 (MarkAllenWeiss)
542
800000
无
本书介绍了常见的数据结构，如链表、堆栈、队列、树、哈希表等，并对查找、排序等进行了算法分析，还给出了相应的Java实现。 本书逻辑结构严谨，主次分明，可用做计算机教材或程序员参考用书。
Chapter 1 Introduction 1.1 What's the Book About 1.2 Mathematics Review 1.3 A Brief Introduction to Recursion 1.4 Generic Objects in Java 1.5 Exceptions 1.6 Input and Output 1.7 Code OrganizationChapter 2 Algorithm Analysis 2.1 Mathematical Background 2.2 Model 2.3 What to Analyze 2.4 Running Time CalculationsChapter 3 Lists,Stacks,and Queues 3.1 Abstract Data Types(ADTS) 3.2 The List ADT 3.3 The Stack ADT 3.4 The Queue ADTChapter 4 Trees 4.1 Preliminaries 4.2 Binary Trees 4.3 The Search Tree ADT——Binary Search Trees 4.4 AVL Trees 4.5 Splay Trees 4.6 The Traversals(Revisited) 4.7 B-TreesChapter 5 Hashing 5.1 General Idea 5.2 Hash Function 5.3 Separate Chaining 5.4 Open Addressing 5.5 Rehashing 5.6 Extendible HashingChapter 6 Priority Queues(Heaps)……Chapter 7 SortingChapter 8 The Disjoint Set ADTChapter 9 Graph AlgorithmsChapter 10 Algorithm Design TechniquesChapter 11 Amortized AnalysisChapter 12 Advanced Data Structures and ImplementationAppendix A Some Library RoutinesAppendix B The Collections LibraryIndex
无