资源列表
huise
- 数学建模中常用的灰色预测程序，经整理，有注释-Commonly used mathematical modeling of gray prediction program, collated comment
chazhi
- 数学建模中常用的数据插值程序，经整理，有注释-Commonly used mathematical modeling data interpolation procedures, have been collated, annotated
cengcifenxi
- 数学建模中常用的层次分析法，完整的、自己调试过的程序-Commonly used mathematical modeling analytic hierarchy process, complete debugging program
2013A
- 2013年美国大学生数学建模竞赛A题程序-the code of 2013 mcm(A)
stack1
- a stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop.[1] The relation betw
FisherLDA
- Fisher线性判定函数，输入训练集及测试集，输出错误率和线性判别函数。-The Fisher Linear determine the function, enter the training set and test set, the output error rate and linear discriminant function.
ToH
- The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower,[1] and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts wit
Representing-and-Operating-on-an-N-inary-Tree-V3.
- This representation is a bit annoying because the kids array must be allocated separately from the node, and you need to reallocate the kids array every time you add a new kid to a node. Alternatively, you could instead over-allocate in anticipation
Frame-difference-method
- 帧差发源代码，来自matlab中文论坛，毕业设计需要-The frame difference originated code from Matlab Chinese Forum, graduation design needs
Heap-Sort-Algorithm-Pseudo-Code
- The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the arra
matlab-Digital-image-processing
- matlab 数字图像处理源代码，需要毕业设计的可以在此处下载-matlab digital image processing source code graduation design is required can be downloaded here
BT
- code for binary tree A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.