资源列表
数列极差
- 在黑板上写了N个正整数作成的一个数列，进行如下操作： 每一次擦去其中的两个数a和b，然后在数列中加入一个数a×b+1， 如此下去直至黑板上剩下一个数，在所有按这种操作方式最后得到的数中， 最大的max，最小的为min，则该数列的极差定义为M=max-min。
Subseofseveralquestions
- 子集和数问题 实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树-Subset of several questions on the implementation of the minimum spanning tree implementation plans, the passage of this algorithm can find this chart connecting all points of the minimum spanning tree
newtron
- 牛顿迭代算法在C里面的实现，速度不错-Newton iterative algorithm in C inside the realization of the pace. . .
gas_fourier
- 对高斯脉冲进行傅立叶变换，高斯脉冲参数可调-the Fouier Transform of the gas pulse.
abc
- 单链表的归并排序，你可以用它来实现一个单链表的归并排序。-A single list of merge sort, you can use it to achieve a single list of merge sort.
mylsm.m
- 一种采用LMS算法来求出滤波因子和输出函数函数。-A function which can calculate the filer impulse response and output signal base on LMS algorithm.
houla-houcha
- 数值计算方法，将连续方程离散化，用插值方法，主要有后差，欧拉，前插等方法，这里是欧拉后差方法的代码-Numerical methods, discretization of continuous equations, with the interpolation method, mainly after the poor, Euler, forward runs and so on, here is the code for the Euler difference method after
MergeSort
- Merge sort 归并排序 MIT公开课Introduction to Algorithms 6.046j/18.410j, Lecture 2课堂实例 环境：g++/ Win7 April 15, 2012-Merge sort example MIT Introduction to Algorithms 6.046j/18.410j, Lecture 2 g++/ Win7 Qian Mao, Information Networking Institute, C
BM
- 这个是B-M算法的C++变成实现方法，很容易就能解决繁琐的B-M算法，非原创，亲测可用-This is the BM algorithm C++ become realization, it is easy to be able to solve the complicated BM algorithm, non-original, pro-test available
HalfSetAlgorithm
- 利用备忘录策略，采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
Expression-evaluation
- 利用堆栈解析算术表达式的基本方法进行表达式求值。-Stack basic analytical methods use arithmetic expressions were expressions.
Dinkelbach
- 最优比率生成树,设计Dinkelbach定理，运用prim算法与迭代算法-Minimum ratio spanning tree