资源列表
经典算法演示系统
- 这是一个经典的数据结构动态演示系统,支持C语言和pascal语言,对初学者肯定会有很大帮助-This is a classic demonstration of dynamic data structure, and C language support pascal language for beginners certainly be of much help
Kruse_Chapter_7
- 本文是介绍数据结构中的二分查找，比较数等思想及算法的-this paper is to introduce the data structure to search two hours, a few more ideas and algorithms
Kruse_Chapter_8
- 本文介绍了数据结构中的选择排序，希尔排序等算法，采用全英文版，真实可靠-This paper introduces the data structure of choice, in order of ranking algorithms such as Hill, was used in English, true and reliable
6.2
- 实现哈希表的建立,插入等功能,并用初留余数法构造,处理冲突-Realize hash wish foundation of form , function of meddling in etc. , and with leave remainder law construct for the first time, deal with the conflict
improved mergesort
- 这是一个改进了自顶向下的归并排序，它改进的地方主要有：采用小子文件截止的机制，当序列长度小于32时，采用直接插入排序；对归并的内循环作了优化，判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the us
echsh
- 二叉树的各种遍历。递归和非递归遍历以及层次遍历。-the binary tree traversal. And recursive and non - recursive traversal level traverse.
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be
gelei combination
- 该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
C2-1
- 有关新型标的创见，插入，删除等操作.使用C语言编写的，自我感觉还不错-the subject of a new innovative, insert, delete operation. The use of the C language, and feel quite well
煤气管道设计
- 一个最短路径算法，具体内容程序开头有介绍-a shortest path algorithm, the specific content of the beginning of a process introduced
inordervisit
- 该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non - recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.