mk检验程序

内嵌汇编写的起泡排序，XP下VC6.0编译通过。-embedded compilation write bubble sort, XP VC6.0 compile.

一个大整数运算类，其中用了Windows下的汇编语言做了优化，在Visual C++ .NET下编译通过-A large category of integer calculations, which used the Windows under optimized assembly language, in the Visual C++. NET compiler passed under

Kalman Filter 是一个递归的估计，即只要获知上一时刻的状态估计和当前状态的观测就可以计算出当前状态的估计，不同于其他的估计技术，Kalman 滤波器不需要观测或/和估计的历史记录，KalmanFilter 是一个纯粹的时域滤波器，而不像低通滤波器等频域滤波器那样，需要在频域中设计，然后转换到时域中应用。 本代码是用C语言实现卡尔曼滤波。

产生随机数相关的C程序-generated random numbers related to the C program

% Syntax: x=sirt(A,b,tolx,maxiter) % % Inputs: %       A   = Constraint matrix.     A=一个约束矩阵 %       b   = right hand side.       b=右边  %    tolx   = Terminate when the relative diff between   tolx=终止时，两次迭代之间的相对差异小于tolx。 %             two iterations is less than tolx. % maxiter   = Stop after maxiter iterations.         maxiter=停止迭代后 % % Outputs: 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

ACM模拟试题 开心的金明 附件中有详细的题目要求和运行通过的源代码-Jinming happy ACM mock examination papers are detailed in the annex to the subject requirements and operating through the source code

無照先乘除後加減優先運算規則

解决线性规划优化问题，在lingo界面中得到广泛的运用-solve linear programming optimization problems, the lingo interface widely used

关于数组的一些算法，有关二分法排序的一些东西我感觉还不错，大家给指导一下看看有什么不足之处-Algorithm on some of the array, the sort of dichotomy something I feel good, tell everyone to see what the inadequacies of

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.