资源列表
DataStatistics.rar
- 对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.,DataStatistics
graph_kruskal
- 最小生成树经典代码，，，很有逻辑性，，，希望对你有帮助-Classical minimum spanning tree code,,, very logical
Md5
- 用于生成MD5，对大文件操作非常的快，我用了，特别NB的呢。-Used to generate MD5, operations on large files very fast, I used, especially NB in it.
SOR
- 松弛因子的介绍（“松弛迭代法是高斯-塞德尔迭代法的一种加速方法，基本思想是将高斯-塞德尔迭代法得到的第k+1次近似解向量与第k次近似解向量作加权平均，当权因子（即松弛因子）w选择是适当时，加速效果很明显。因此这个方法最关键的是如何选取最佳松弛因子。"）和算法。-Relaxation factor of the introduction (" relaxation method is the Gauss- Seidel iteration method for an accelerated
parallel-sorting_GPU
- 基于CUDA的并行排序GPU-BBSort 需要NVIDIA显卡支持-CUDA Parallel Sorting on GPU-BBSort NVIDIA graphics support needed
binarytree
- 二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。-Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.
Huffman
- 编写一个程序，根据输入节点的权值，建立哈夫曼树并实现哈夫曼编码，同时输出哈夫曼编码.-Write a program, according to the input node weights, establish and implement Huffman coding Huffman tree, and output the Huffman coding.
Hamiltonian-graph
- 哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，-determine Hamiltonian graph : After all the vertices of a graph and only one loop is called Hamiltonian circuit. A graph that has a Hamiltonian circuit is called a Hamiltonian map,
Three-splines-function
- vb三次样条插值函数，具有高精度的拟合，实现光滑作图-vb cubic spline interpolation function, with high-precision fit to achieve a smooth mapping
findstring
- 用于查找一个字符串中给定子串出现的次数，并输出删除给定子串后的原串-Find a string in the string appears to the stator frequency and the output will be deleted after the substring of the original string
yuesefu
- 约瑟夫环问题：设编号为1,2,3,……,n的n(n>0)个人按顺时针方向围坐一圈,每个人持有一个正整数密码。开始时任选一个正整数做为报数上限m,从第一个人开始顺时针方向自1起顺序报数,报到m是停止报数,报m的人出列,将他的密码作为新的m值,从他的下一个人开始重新从1报数。如此下去,直到所有人全部出列为止。令n最大值取30。要求设计一个程序模拟此过程,求出出列编号序列。-Josephus problem: Let numbered 1,2,3, ... ..., n of the n (n&
MaxSum
- 用动态规划算法完成最大子矩阵和问题，是最大子段和问题向二维的推广。-Complete with a dynamic programming algorithm and the largest sub-matrix problem, the problem is the largest sub-segment and the promotion of the two-dimensional.