资源列表
Matrix111
- 矩阵连乘问题 对多个矩阵连乘时 的消耗进行分析-matrix continually multiply problems for a number of matrix continually multiply the consumption analysis
Romberg_C++
- 数值算法 龙贝格积分 C++实现 用迭代的方法求定积分-numerical algorithm Long Bergh C integral to the realization of iterative methods used to seek integration
WashTransformation
- 计算给定序列的沃什(Walsh)变换序列。
regrRR
- Ridge Regression RR 岭回归估计，是非常有用的非线性时间序列算法，在局部多项式预测中非常有用。
queen
- 用Python实现的八皇后问题-Using Python to achieve the eight queen problem
c
- 输入一个字符串，内有数字和非数字字符。将其中连续的数字作为一个整数，一次存放到一个数组a中。统计共有多少个整数，并输出这些数。-Enter a string containing numbers and non-numeric characters. Will be one of a number of consecutive integers, one in a store into an array. Statistics Total number of integers, and the
AdjList
- 图的深度遍历一个简单的C++程序代码 写得一般吧 还在学习当中-Graph traversal depth
xianxinbiao.c
- 建立一个线性表，并对其进行维护：查找某一值的节点，在某一位置插入一个节点，删除某一节点，对某一节点的值进行修改。-A linear form, and its maintenance: Find the value of a node, a node in a particular Insert, delete a node, the value of a node changes.
JOSEPHUS
- 用链表实现的约瑟夫环，模块化设计，便于初学者理解-Joseph Ring a linked list implementation, modular design, easy for beginners to understand
bag1
- 使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。-Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.
BiTree
- 1、用前序方法建立一棵二叉树。 2、编写前序遍历二叉树的程序。 3、编写中序遍历二叉树的程序。 4、编写后序遍历二叉树的程序。 5、编写统计二叉树叶子结点个数的程序 -A pre-order methods, the establishment of a binary tree. 2, the preparation of pre-order traversal binary tree program. 3, write the preorder traversal bina
POJ2492
- 自己写的并查集，适用于分类并查集，路径压缩时使用了偏移量的转移公式增加了算法的实用性。-Write your own and search sets for classification and search sets, path compression offset used when the transfer formula increases the practicability of the algorithm.