资源列表
stack
- 它按照后进先出的原则存储数据，先进入的数据被压入栈底，最后的数据在栈顶，需要读数据的时候从栈顶开始弹出数据（最后一个数据被第一个读出来）。 -It is in accordance with the principle of LIFO store data, first enter the data is pushed onto the stack at the end, the last data in the top of the stack, you need to read data f
Huffman
- 哈弗曼树的构建 左子树为较小者，右子树为较大者-The struction of HuffmanTree
KnapsackProblem
- 用动态规划的方法求解0/1背包问题，vc编写。-Using dynamic programming method for solving 0/1 knapsack problem, vc preparation.
KnapSack1
- knapsack problem to get maximum profit
0_1beibao
- 0——1背包的算法，使用数组存储，内含测试数组-0- 1 knapsack algorithm, using an array of storage, an array containing the test
BSTree
- 二叉排序树。 键盘输入一句话，按字母顺序排序，然后中序输出-Binary search tree. Keyboard input word, sorted alphabetically, and then the output sequence
findextm
- 用于提取二维图形的局部极值点，为下面的二维EMD分解做基础，效果不错-Used to extract local extreme point of the two-dimensional graphics, and for the following two-dimensional EMD decomposition as a foundation, good results
card1
- hen hao de shen fen zheng shi bie shen ge dai ma-this is a good code that can segment the id, it is useful.
tree
- 以广义表的形式输入一个树，创建该树，并且中序遍历输出-The generalized form of a table to enter a tree, the tree is created, and the output preorder
face
- 简单的人脸识别程序，虽然简单，但可以很好的检测人脸。-Simple recognition program
likai
- 数学建模问题，根据已有的数据建立模型，来预测后面的数据-Mathematical modeling, based on the existing data model to predict the following data
ex1201
- 1对一幅源图像进行二维分解并显示多层二维分解结果 2重构原始图像信号 -Source image on a two-dimensional display image reconstruction decomposition decomposition