资源列表
TriHANOI
- 自己写的汉诺塔程序,IDE是TC2.0 程序特点: 1)三根柱子都有若干盘子 2)程序可演示运行过程 编译时需要根据实际情况修改下面这句: initgraph(&driver,&mode,\"c:\\\\TC2\\\\BGI\") -himself wrote the Tower of Hanoi procedures, IDE process is TC features : 1) three pillars have a number plate 2) demons
CH07_Water
- 分水问题，是数据结构的实验问题。主要运用了栈的概念和穷举的算法。-tapping issue is the experimental data structure problem. Primarily use the concept of the stack and exhaustive algorithm.
MATLAB_FD
- 整数规划的分枝定界法在MATLAB中的实现-integer programming branch of the profession in the realization of MATLAB
lagrangeNewton
- 用VC实现了拉哥郎日插值和牛顿插值的数值算法 并进行了比较-with VC Barayagwiza a few days interpolation and Newton interpolation algorithm and compared
no-doolittle
- 用doolittle分解法（非选主元）解用户输入的线性方程组。若无法解，将提示用选主元的doolittle分解法(见另一上传文件)解方程-with doolittle decomposition (non-elected PCA) user input solutions of linear equations. If there is no solution, the election will be prompted to use the PCA doolittle decompositio
main-doolittle
- 用选主元的doolittle分解法解用户输入的线性方程组。共4文件。-election with the main yuan doolittle decomposition method for user input linear equations. A total of four documents.
guass2
- 用列主元高斯法解用户输入的线性方程组。包含3个文件。-out with PCA Gaussian user input method for the linear equations. Contains three documents.
Bala
- 给定n个整数a , a , ,an 1 2 组成的序列。序列中元素i a 的符号定义为： ï î ï í ì - < = > = 1 0 0 0 1 0 sgn( ) i i i i a a a a 符号平衡问题要求给定序列的最长符号平衡段的长度L，即： þ ý ü î í ì = + - = å =
PowerCount
- 设给定n 个变量1 x , 2 x ,…, n x 。将这些变量依序作底和各层幂，可得n重幂如下 n x x x x 3 2 1 这里将上述n 重幂看作是不确定的，当在其中加入适当的括号后，才能成为一个确定的 n 重幂。不同的加括号方式导致不同的n 重幂。例如，当n=4 时，全部4重幂有5个。-located n given a variable x, x 2, ..., n x. These variables in order to end
GAprogrames
- 收集的GA的一些源程序，包括交叉选择变异之类的一些。可以在MATLAB下直接使用的。学习遗传算法的可以看看。-GA collected some of the source, including cross-choice variation of such. MATLAB under the direct use. Learning Genetic Algorithm can see.
minitree
- 这是用VC实现的一个查找最小生成树的程序，界面很漂亮，实现的功能也很好。具有固定的节点，权值可以任意输入，最后确定一个最小的生成树。-This is the VC search for a minimum spanning tree procedures, a very nice interface, function very well. Having fixed nodes, the weights can be arbitrary input to finalize a minimum s
newrank
- 这是用VC++做的一个堆排序的程序，非常适合用作数据结构的课程设计。有默认的输入，并且可以生成树型结构。-This is done with the VC heap sort of a procedure, very suitable for the data structure used for the design. Is the default input, and generate the tree structure.