UserCF 协同过滤

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time

遗传算法通用包，用于解决 DSP问题，传入配送点数据文件位置，文件格式如： 3 4 1 2 4 7 5 3 1 12 13 2 22 21 即可输出结果。

给出插值算子的算法，牛顿法求解非线性方程，欢迎大家给出意见。-Interpolation operator is given algorithm, Newton method for solving nonlinear equations, welcome to give their views.

求出1-1000之间的所有能被7整除的数，并计算和输出每5个的和，控制台应用程序。

C语言基本排序算法，经过测试！-C language basic sorting algorithm, the test!

基于VC单文档的可视化B样条曲线绘制和仿真，可给定控制点，根据给定设定点自动绘制拟合后的B样条曲线，对学习B样条原理有很大帮助

计算时间序列的近似熵,英文为Approximate entropy此程序可以较为快速的计算出序列的近似熵。

一个简单的计算器程序，进行简单的数学计算，正确无误-A simple calculator program to carry out simple mathematical calculations are correct

非线性方程组不能用消去和分解法进行求解，jacabi迭代和高斯迭代是最常用的两种迭代方法-Nonlinear equations can not be eliminated and the decomposition method to solve, jacabi iteration and Gauss iteration is the most commonly used two types of iterative methods