c程序各种经典算法

this will host ms paint-this will host ms paint...

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

这是我做数据结构课程设计里面的一个设计程序，二叉树排序-This is my curriculum design make the data structure inside a well-designed procedures, binary tree sort

mysql数据库的软件-mysql database software

这是程序是老师提供的源程序，其中包含了方程的离散等解法 值得一学习。-This is the program source code is provided by teachers, including the discrete equations method, etc. It is worth learning.

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

数据结构往年试题及答案-Data structure in previous years questions and answers

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

模式识别matlab工具箱,包括SVM,ICA,PCA,NN等等模式识别算法,很有参考价值-pattern recognition Matlab toolbox, including SVM, ICA, PCA, NN pattern recognition algorithms, and so on, of great reference value

Moodle 是一个开源免费的电子学习网站。 简单下载 moodle 安装它...... 在你的 htdocs...... & 使用它在多个方面......访问作为老师经理、 学生、 部门首长和管理员...