资源列表
OptimizedQuickSort
- OptimizedQuickSort 理论上快速排序的平均时间复杂度是nlgn.最差是n^2. 但实际实现中可能表现的不如插入排序等其他算法。 -OptimizedQuickSort
2002
- 一份数据结构试卷，质量不错的，几本涵盖了学习要点，希望对大家有用。-Data structure of a paper, good quality, the study covers several key points, useful for all of us hope.
2004
- 一份数据结构试卷，质量不错的，几本涵盖了学习要点，希望对大家有用。-Data structure of a paper, good quality, the study covers several key points, useful for all of us hope.
Chapter4
- 几道数据结构的题，有详细答案，希望对大家有用。-Several of the title data structure, a detailed answer, I hope useful for all of us.
Chapter5
- 几道数据结构的题，有详细答案，希望对大家有用-Several of the title data structure, detailed answers to all of us hope that useful
Chapter6
- 几道数据结构的题，有详细答案，希望对大家有用-Several of the title data structure, detailed answers to all of us hope that useful
Chapter9
- 几道数据结构的题，有详细答案，希望对大家有用-Several of the title data structure, detailed answers to all of us hope that useful
SORTING
- 包含如何加是插入式排序、如何在快速法中處理值相等的元素，使得排序完成之後值相等的元素仍然維持原來的順序 -Includes how to add plug-in is sorted, how to deal with in the fast-law elements of equal value, the value after the completion of the same sort of elements to maintain the original order and so on
STRING
- 介紹了knuth-morris-pratt方法與化簡了的boyer-morre方法，這兩個方法在尋找字串中是否有一個特定的字串時有相當傑出的表現-Introduced knuth-morris-pratt methods and simplification of the boyer-morre method, the two methods in the search string if the string has a specific time to time the performanc
datastructure
- 简单的数据结构与算法，C描述，适合初学者自学-Simple data structure and algorithm, C descr iption, suitable for beginners and self-
CCode
- 遗传算法CUse time of day to feed the random number generator seed
erchashu
- 对于二叉树的基本的运算，查找孩子结点，查看叶子节点到根节点的路径~ 二叉树的宽度。-For computing the basic binary tree to find the child node to view the leaf node to the root of the width of the path-tree.