资源列表
ADT
- 实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The int
组合
- 对任意给定的n,用字典法和邻位互换法生成并打印全部排列。-right to the arbitrary n, using the dictionary to law and Exchange Act o-generated and print all ranked.
muzi
- 利用C语言实现两个多项式的加法,依次输入输入指数和系数,数据输入以(0,0)结束-use C language two polynomials additive, in order to import and importation index coefficient, data input to (0,0) end
MUZI3
- 随机产生5组测试数据,分别进行顺序查找,折半查找和分块查找,输出比较结果-five groups randomly generated test data, for the order to search, locate and half-block search, the output results
iris data analysis
- 经典的人工智能问题 - iris数据分析问题。通过设计三层bp神经网络对花朵数据进行分类识别,并达到了很好的效果。-classic AI problem - iris data analysis problems. Three-bp through the design of neural networks classify data flower identification, and to achieve good results.
HOFFMAN
- 霍夫曼coding程序,用此程序可以对任意图像进行霍夫曼编码。-Huffman coding procedures, this procedure can be used for any image Huffman coding.
平方取中法
- 过JAVA编程产生一系列伪随机数,掌握平方取中法、乘同余法、混合同余法产生均匀随机数的方法。-off Java programming produce a series of pseudo-random numbers, master Mid-square method, I took with the law, mixed with the law I have Random Number method.
哈夫曼算法源程序
- 哈夫曼算法的源程序,根据清华大学数据结构一书中的算法编写-Huffman algorithm source code, according to a data structure of Qinghua University's book algorithm
ddt
- 算法设计于分析中的多段图问题,用VC编写应用动态规划的算法设计方法,利用最优性原理以及所获得的递推关系式求取最优决策序列,通过多段图的定义,找到由源点s到汇点t的最小成本路径,进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well
tanxinfa
- 算法设计与分析中的贪心法源程序,用VC编写,应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
graycode
- 构造格雷码的分析程序,用于算法分析,用VC编写,可以构造n位的格雷码-Gray Construction Code Analysis Program for the analysis of algorithms, with VC preparation, can be constructed of n-Gray code
station
- 这是数据结构中模拟栈的一个精典例子利用火车进站出站模拟出栈和入栈-This is the data structure of a simulated stack classic examples of using the train station stop simulated stack and pushed