| Mark Allen Weiss，现在是佛罗里达国际大学计算机学院教授，普林斯顿于数据结构与算法方面的著名教材还有：《数据结构与算法分析——C语言描述》，该书中文版已由机械工业出版社引进出版，以及《Data Structures and Problem Solving :Using Java》、《 Data Structures and Prblem Solving:Using C++》等。他目前是Advanced Placement Computer Science Development Committee主席。 |
| 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 |
内容加载中，请稍后...
商品评论（0条）