algorithms(CPP)

文件中包括了最优化中的最小费最大流程序以及例子和程序(File included in the most optimal maximum flow procedures and examples of trees and procedures)

最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。(The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.)

本算法是求取点到曲线的距离，希望对大家有帮助(the algorithm is to strike a point of the distance curve, and I hope to be helpful)

读入红细胞图片，通过中值滤波，开运算算，闭运算，和贴标签等方法获得细胞个数 (Read into the red blood cell picture, opening operation count median filtering, and closing operation, and the labeling methods such as cell number)

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))

最小二乘法拟合形如f(x)=(a+bx)/(1+cx)的函数（9.2.2(1))，并解决人口预测问题(9.2.2(2))(Least squares fit of the form f (x) = (a+bx)/(1+cx) function (9.2.2 (1)), and to solve the population prediction problem (9.2.2 (2)))

对机械中的振动信号进行傅立叶变换，作出频谱图进行分析。(Fourier transform of the vibration signal)

羊与狼的故事...主要实现狼进入若干羊圈后，寻找最后所有羊圈中剩余的狼和眼数目( the wolf and sheep)

Fortran 95程序设计【彭国伦】第7章原代码，非常有学习价值！(Fortran 95 programming [Lun Peng-- Chapter 7 of the original code, the very value of learning!)

共轭梯度法求解凸二次规划，代码由C语言开发，老外编写的程序，很值得一读。(Conjugate gradient method for solving convex quadratic programming, code generated by C language development, foreigners prepared program, it is worth reading.)