An Introduction to Algorithm 2nd 's contents

算法导论(2nd) 结构

* [b]<Introduction to Algorithms 2nd> (total 984 page,8 part)[/b]
* [b]part 1[/b] (chp 1 - 5)
foundation of algorithms (基础入门)

* [b]chp 1[/b]
an overview of algorithms and their place in modern computing systems
This chapter defines what an algorithm is and lists some examples.
It also makes a case that algorithms are a technology, just as are fast hardware, graphical user interfaces, objectoriented systems, and networks.
* [b]chp 2[/b]
see our first algorithms,which solve the problem of sorting a sequence of n numbers.
We use a pseudocode to descript it,which could be implement into any existing language by a competent programmer.
We use two different algorithms to solve the problem,and with the n increase,we compare the algorithms.
* [b]chp 3[/b]
defines a notation,which we call asymptotic notation
* [b]chp 4[/b]
delves further into the divide-and-conquer method (分离，按步解决),
particular,contains methods for solving recurrences.
* [b]chp 5[/b]
introduces probabilistic analysis and randomized algorithms (概率分析 & 随机算法).

* Appendices A-C
contain mathematical material that you will find helpful as you read this book.
*
* [b]part 2[/b] (chp 6 - 9)
sort & order statistics (排序 & 次序统计)

* [b]chp 6[/b]
heapsort (堆排序),sorts n numbers in place in O(n lg n) time,
use an important data structure,called a heap,which we can implement a prority queue.
* [b]chp 7[/b]
quicksort (快速排序),
its worst-case running time is Θ(n2), its average-case running time is Θ(n lg n),
and it's generally outperforms heapsort in practice(通常比 heapsort 要更高效).
* [b]chp 8[/b]
introducing the dicision-tree model in order to study the performance limitations of comparson sorts.
counting sort algorithm,
related algorith,radix sort,
* [b]chp 9[/b]
order statistics
*
* [b]part 3[/b] (chp 10 - 14)
data structure (数据结构)

* [b]chp 10[/b]
simple data structures (基本数据结构)
* [b]chp 11[/b]
hash table (哈希表)
* [b]chp 12[/b]
binary search trees (二分查找树)
* [b]chp 13[/b]
red-black trees (红黑树)
* [b]chp 14[/b]
show how to augment red-black trees to support operations other than basic ones.
*
* [b]part 4[/b] (chp 15 - 17)
advanced design and analysis techniques (高级 设计 & 分析 技术)

* [b]chp 15[/b]
dynamic programming (动态编程)
* [b]chp 16[/b]
greedy algorithms (贪婪算法)
* [b]chp 17[/b]
amortized analysis (分摊分析)
*
* [b]part 5 [/b](chp 18 - 21)
advanced data structures (高级 数据结构)
* [b]chp 18[/b]
B-Trees
* [b]chp 19[/b]
Binomial Heaps
* [b]chp 20[/b]
Fibonacci Heaps
* [b]chp 21[/b]
Data Structures for Disjoint Sets
*
* [b]part 6[/b] (chp 22 - 26)
graph algorithms (图 算法)

* [b]chp 22[/b]
elementary graph algorithms (图 的 基本算法)
* [b]chp 23[/b]
minimum spanning tree (最小生成树)
* [b]chp 24[/b]
single-source shortest path (单1起点 最短路径 问题)
* [b]chp 25[/b]
all-pairs shortest path (全对 最短路径 问题)
* [b]chp 26[/b]
maximum flow (最大流)
*
* [b]part 7[/b] (chp27 - 35)
selected topics (精选 专题)

* [b]chp 27[/b]
Sorting Networks (排序网络)
* [b]chp 28[/b]
Matrix Operations (矩阵运算)
* [b]chp 29[/b]
Linear Programming (线性规划)
* [b]chp 30[/b]
Polynomials and the FFT (多项式与快速傅里叶变换)
* [b]chp 31[/b]
Number-Theoretic Algorithms (数论算法)
* [b]chp 32[/b]
String Matching (字符串匹配)
* [b]chp 33[/b]
Computational Geometry (计算几何学)
* [b]chp 34[/b]
NP-Completeness (NP 完全性问题)
* [b]chp 35[/b]
Approximation Algorithms (近似算法)
*
*[b] part 8 [/b](Appendix: A - C)
Appendix:Mathematical Background (附录：相关 数学)

* [b]Appendix A:[/b]
Summations (求和)
* [b]Appendix B:[/b]
Sets, Etc. (集合)
* [b]Appendix C:[/b]
Counting and Probability (求总数 & 概率)
*

*
*
------------------------------------
<An Introduction to Algirithm> 's online resource:
* [url]http://www.verycd.com/topics/87348/[/url] 第2版， 英文，note，视频 等
* [url]http://www.verycd.com/topics/2825438/[/url] 第2版， 中文，英文
*