资源列表
speckle
- 对图像进行斑点噪声的添加，用方程f=f+n*f将乘性噪音添加到图像f上，其中n是均值为零，方差为var的均匀分布的随机噪声。
Newton.rar
- 最优化程序设计方法中,牛顿切线法的例子,更改函数可用于其他例子的求解,Program design optimization methods, examples of Newton' s tangent method, change the function of other examples can be used to solve
ShortDistance
- 或得一个连通图两两之间最短路径的代码，算法导论上的算法，自己实现的-a funtion to get the shortest distance between each to noeds in a graph
f31
- 蛇顺序表中的关键字是递增有序的，将监视哨设在高下标端，设计算法实现简单顺序查找-Snake order keyword in the table are incremental and orderly, and will monitor the post is located in Gao Xia S side, the design algorithm is simple in order to find
k_m_p
- 字符查找，效率最高,这是著名的kmp算法、算是经典中之经典-you can search strings,and it is the best
bsort
- 数组排序中很经典的算法——冒泡排序法，FORTRAN90语言编成。-Sorting an array of classic algorithms- bubble sort method, FORTRAN90 language compiled.
01
- C++十分查找算法 只要数组中有目标对象存在，是一定可以查找到目标对象-C++ is the search algorithm
tanxin
- 节目安排（贪心算法描述），输入11个节目的起止时间，输出最多可以安排的节目的编号-Programming (greedy algorithm descr iption), enter the starting and ending time of 11 programs, the output maximum number of programs can be arranged
merge_sort
- program for merge sort
Queen
- 八皇后问题的简单实现，运用回溯方法，可是-Simple implementation of the eight queens problem, the use of retrospective methods
Josephus
- 约瑟夫环 程序可直接运行 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Josephus program can be run directly known n individuals (No. 1, 2, 3, ... n, respectively) were sitting around a round table. K repor