资源列表
increasingSeauence
- 这是一个关于sequence不断增大的问题,虽然不是太大但很是精辟.-This is a sequence of the growing problem, although not very much but is brilliant.
hurstZS.rar
- 另一种赫斯特指数的算法，此算法计算速度要快，但精度不及另一个。,Another Hurst exponent of the algorithm, this algorithm is faster, but the precision of less than another.
ZuiYouMaoYi(noip2009)
- ZuiYouMaoYi(noip2009) noip 2009 第三题 AC 代码-ZuiYouMaoYi(noip2009)
SOR
- SOR方法解线性方程组，一般解法和矩阵解法。（MATLAB程序）-SOR method to solve linear equations, the general method and matrix method. (MATLAB program)
mul
- 用C++语言实现实矩阵相乘，这是数值计算中常用的算法。-C++ language with real matrices, which is commonly used in numerical algorithms.
subgraph
- 复杂网络计算程序，获得subgraph中心度-Get subgraph
gmres
- The GMRES method was developed by Yousef Saad and Martin H. Schultz in 1986.[1] GMRES is a generalization of the MINRES method developed by Chris Paige and Michael Saunders in 1975. GMRES also is a special case of the DIIS method developed by Peter P
xishujuzhen
- 稀疏矩阵的运算，主要是通过十字链表的方式进行实现的 十分有效 适合初学者-Sparse matrix operations, primarily by way of the cross linked list achieve very effective for beginners
Burgers_Mac
- 运用MacCormack格式求解非线性Bugers方程的Matlab程序-A Matlab program used MacCormack scheme to solve the Bugers equation.
meijupailiezuhe131
- T012_枚举排列组合131,关于枚举排列组合的算法-T012_ enumerate permutations 131, permutations and combinations on the enumeration algorithm
Joseph
- 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺 时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作 为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时 停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮 报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺 序。-Joseph (Joseph) a descr iption of the problem is: th
HeapSort
- 堆排序非递归实现 代码注释详细，简单易懂-heapsort no recursion