圣智学习

数据结构和算法课程是计算机科学教育的核心内容，本书提供了该领域心备的知识。根据当前的设计和实现范例，本书以面向对象的方式描述数据结构，深入浅出地廛解了相关的难点。Drozdek强调了数据结构和算法之间的关系，分析了算法的复杂性，还讲解了增强封装和分解的信息隐藏原理，对递归方法进行清晰的阐述了不同类型的递归。
 

Adam Drozdek，毕业于美国莱特州立大学，现任迪尤肯大学计算机系副教授。曾出版多部著作，包括《Data Structes and Algorithms in C++》和《The Elements of data Compression》等。

1 object-oriented programming using jva
1.1 rudimentary java
1.2 object-oriented programming in java
1.3 input and output
1.4 java and pointers
1.5 vectors in java.util
1.6 data structures nd object-oriented programming
1.7 case study:random access file
1.8 exercisee
1.9 rrgramming assignments
bibliography
2 complexity analysis
2.1 computational and asymptotic complexity
2.2 big-o notation
2.3 prorerties of big-onotation
2.4 adn notations
2.5 possible problems
2.6 examples of complexities
2.7 finding asymptotic complexity:examples
2.8 the best,average,and worst cases
2.9 amortized complexity
2.10 np-completeness
2.11 exrcises
bibliography
3 linked lists
3.1 singly linked lists
3.2 doubly linked lists
3.3 circular lists
3.4 skip lists
3.5 self-organizing lists
3.6 sparse tables
3.7 lists in java.util
3.8 concluding remarks
3.9 case study:a library
3.10 exercises
3.11 programming assignments
bibliography
4 stacks and queues
5 recursion
6 binary trees
7 multiway trees
8 graphs
9 sorting
10 hashing
11 data compression
12 memory management
13 string matching
appendixes
name index
subject index