资源列表
JM97B
- 98年全国大学生数学建模竞赛B题\"水灾巡视问题\"模拟退火算法。-98 National Mathematical Contest in Modeling B and that the "flood inspections" simulated annealing.
memory_pool
- fast buddy memory pool
hefumanbianma
- 赫夫曼编码,用二叉树的方法来做哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。，-Huffman coding method of binary tree to do,
3
- c语言描述的后缀表达式计算 非常简陋的-Calculation of postfix expressions
test7
- 用牛顿插值法的数值分析方法来求函数，并画出函数-Newton interpolation with numerical analysis to find the function, and draw the function
student-record-double-circular
- student record double circular code
Remove_PhaseDistortion
- 数字全息再现中往往会出现二次球面因子导致相位畸变，本函数基于最小二乘法拟合球面并解出不含二次球面因子的原相。-Digital Holography often secondary spherical factor leading to phase distortion, this function is based on the least squares fit sphere and solve the original phase without secondary spherical fa
Partial-least-squares
- 偏最小二乘法回归。使用这个方法计算出一组数据的回归方程-Partial least squares regression. Use this method to calculate the regression equation of a set of data
2
- 掌握二叉树的链式和顺序存储结构，利用队列对二叉树进行运算。 二、实验内容： 1) 编写函数creatbt，其功能是将一维数组方式存储的二 叉树转化为链式存储的二叉树，返回root指针。 2) 编写函数freebt，其功能是释放二叉树链表节点的存储 空间。函数原型为：void freebt (TNODE * root) 3) 编写函数实现前序、中序和后序遍历； -Master chain and sequential storage structure of the binar
sparse-matrix
- 一个稀疏矩阵，按照列主次的顺序存储到一维数组中，支持存储和搜索。-A sparse matrix, primary and secondary storage in the order listed to a one-dimensional array, support storage and search.
closet-pair-problem
- 求平面内中距离最短的两点的距离,使用分治算法实现的C++代码-closet pair problem
Kmean
- KMEAN聚类,主要是提供聚类封装函数，只需传人参数-KMEAN clustering, clustering is mainly to provide package function only transmission parameters