Sort ranked scoring option, insert, Bubble Sort Shell Sort

The Kalman filter30 is a minimum-variance filter in which time-series measurements are incorporated recursively into estimates of state variables it is the optimal, Bayesian least-squares estimator for linear dynamic systems.-The Kalman filter30 is a minimum-variance filter in which time-series measurements are incorporated recursively into estimates of state variables it is the optimal, Bayesian least-squares estimator for linear dynamic systems.

Data Mining 算法-Data Mining Algorithms

这一项目是关于光学 ofdm 系统与 optisystem ；项目描述中长途交流光学 ofdm 系统

GNU的数值运算库,内容丰富!-GNU numerical arithmetic library, a rich content!

CFO(carrier frequency offset) and channel estimation in 802.11 system. The algorithm use the subspace based approach to estimate the CFO.

快速排序与最长公共子序列算法(Visual C++)-Quick Sort and the longest common sub-sequence algorithm (Visual C++)

C++ split函数，可以实现字串的分割。可自定义分割符号，方便在编程时使用，根据需求设定分割字符或字符串均可。实用测试正常。

求定积分的通用函数，以给定算例，演示了定积分的求解过程，简单明了。-Seek a common definite integral function to the given examples to demonstrate the definite integral of the solution process, simple and straightforward.

C语言算法编程。最小生成树的Kruskal算法 。求加权连通图的最小生成树的算法。kruskal算法总共选择n- 1条边，（共n个点）所使用的贪心准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树。kruskal算法分e 步，其中e 是网络中边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。