资源列表
mend_Euler
- 改进的Euler算法源代码,改进的Euler算法源代码
3432
- 方程求根的数值实验，利用Newton迭代算法，求出所给方程的跟。-Equation Roots of numerical experiments using the Newton iterative algorithm are obtained with the given equation.
guibingpaixu
- 这是我自己写的一个归并排序的算法实现 -This is what I had written a merge sort algorithm ~ ~
130-3
- 对给定的单链表L，设计一个算法，删除L中值为x的结点的直接前驱结点-Single list of a given L, design an algorithm to delete L in the value of x the direct precursor of nodes nodes
guohe
- 农夫过河问题也一直是一个比较经典的问题，本程序能够正确给出农夫如何过河的抉择过程以及解决方法。-The farmer has always been a problem across the river more classic issues, this program shows farmers how to cross the river to the correct choice of process and solution.
er
- 计算二叉树结点总数的个数的，功能很强大的，相信我的代码-Calculate the total number of binary tree nodes, the function is very powerful, I believe my code
kuohao
- 括号匹配。对C语言程序中必须成对出现的符号如“（）”、“[]”、“{}”等进行配对检测。-Matching parenthesis. C language program must be paired with symbols such as "()" "[]", "{}" pair detection.
CubicSpline
- 三次样条插值法（CubicSpline）模拟曲线-Simulation curve of the cubic spline interpolation method (CubicSpline)
ACJDN
- 用全选主元高斯-约当消去法求解系数矩阵相同而具有多组右端常 数向量的复系数线性代数方程组AX=B-PCA Gaussian with Select- Jordan elimination method for solving the same coefficient matrix and constant vector with multiple groups of the right end of the complex coefficients of linear algebraic e
Hotname
- 数据结构采用的是独立链法。用一个maxtimes和maxname实时跟新最大次数及对应的名字。使用了一个 hash函数： hash = hash * 131 + (int)name[j] int serial = hash 10007 （先要卷乘131，然后将得到的结果模一个和10000相近的素数，采用10007）（网络上的现成的算法）。然后生成一个链表，链表由节点组成，节点里面装入姓名和出现的次数；如果出现次数为0，则新建节点，否则在原节点操作（出现冲突时要下拉节点）。-The data st
Monte_carloshili
- monto carlo 模拟实例 初学者可以学习借鉴-monto carlo simulation examples
Interpolation
- Fortran code to interpolating mathemathical fluid properties