资源列表
melkman
- melkman code 多边形求凸包的算法
ID15To18
- 小玩意，把15位身份证转换成18位-gadgets, and 15 ID cards into 18
nizhen
- 这是求矩阵逆的一种方法的源代码.用的是代数余子式求的-This is the inverse matrix of a method
multiplication
- 用线性链表实现两个多项式的相乘，将结果以一般多项式的表示显示出来-Linear chain to achieve the multiplication of two polynomials, the results in general show that the polynomial
mrankwin
- classify the objects in data matrix based on the attributes Criteria: minimize Euclidean distance between centroids and object points For more explanation of the algorithm-classify the objects in data matrix based on the attributes Cr
process_ansys_tri
- 处理AVSYS的剖分数据，试用于曲面三角形单元的剖分情况-get the meshing message of the meshing data by the ANSYS
HOUSEH
- 产生豪斯赫尔得矩阵，用于比较准确的求矩阵特征值-Matrix generated Hausherr was used to evaluate matrix eigenvalue
Untitled1
- 全排列算法之字典序法 全排列算法之字典序法 全排列算法之字典序法-Lexicographic permutation algorithm of the method of lexicographic permutation algorithm method of lexicographic permutation algorithm permutation algorithm for the dictionary method Sequential
interp1_interp2
- C语言实现Matlab中interp1和interp2中的功能。-Interp1 and interp2 in Matlab, C language the function.
binaryTree
- 求二叉树中从根结点到叶子节点的路径 //实现功能： //2． 求二叉树中从根结点到叶子节点的路径 //需求分析： //对于二叉树，分别用递归和非递归的方法编写程序完成如下功能： //1． 输出所有的叶子结点的数据项值。 //2． 输出所有从叶子节点到根结点的路径 //3． 输出（2）中的第一条最长的路径 //程序存在的问题：数值只能输入0~9，其他基本满足要求 //测试数据先序输入：124 7 35 68 9-Find a binary tree from r
Newton
- 使用牛顿迭代法求椭球体上点的坐标，可以根据卫星数据求地面坐标-Use Newton' s method for the coordinates of points on the ellipsoid can find ground coordinates based on satellite data
convert
- 大端模式存储的字节数据向浮点（单精度float、双精度double）、整型(int、long）转换类-Bytes of data stored in big-endian mode to the floating-point (single-precision float, double-precision double), integer (int, long) conversion class