机器学习kNN算法的c语言实现

一个非常好的时钟程序，实时显示当前时间，可以指定在屏幕的任意位置，在屏幕边缘时自动放缩。-a very good clock procedures, real-time display the current time, the screen can be specified in an arbitrary position, at the edge of the screen automatically shrinking.

这个资料室详细讲述最大匹配算法的一片论文很有参考价值，各位做匹配算法的同学可以下载阅读，感觉还是不错的了

c语言的数值算法挺好的!!非常的好!! 包括线性规划,二乘法-c language numerical algorithm is very good! ! Very good! ! Including linear programming, Multiplication .................... 2

操作系统中的进程调度算法-operating system, the process of scheduling algorithm

％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法- [Nearest_neighbours] = find_nearest_neighbours (database, desc, max_dist) Find the indices of the nearest neighbours of the given desriptors in the neighbor-point search algorithm, the nonlinear time series of very useful, is a commonly used algorithm

VB写的增量式PID算法源码，实现了模拟量连续数字输出，和开关量输出自己原创，根据西门子200PLC的公式写出来的

内蒙古大学计算机学院，计算机图形学种子填充算法实现，利用扫描线算法实现的

This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)-This is OpenNL. a library to easily construct and solve sparse l inear systems.* OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradie nt, Application of BICGSTAB. GMRes) and preconditioners (Jacobi, SSOR).* OpenNL can also use other solvers (Super rLU 3.0 is supported as an OpenNL extension, MUMPS will be supported in a future version)

解压后的文件，列举了大量常用的C算法程序，欢迎参考！-unpacked document, listed a number of commonly used algorithm C procedures, reference welcome!

应用背景 这是蓝桥杯往年的一个题目，类似的题目有六角填数、4*4魔方阵等。题目如下图： 将1，2，3，...19填进去，图中已经填了两个数15和13，填完后要求每条直线上的数字之和相等，图中共有十五条直线。 关键技术代码在VS2010上运行。 设和为a, 则a*15/3=(1+19)/2*19  所以 a=38 前两个数已经填好，开始填第三个数，将满足vis=0的数依次填进去。填完第三个数，第一行已经形成了直线，判断第一行的和是不是38. 填完第七个数，新增加了一条直线（第二行），判断它的和。填完第八个数，增加了一条线（45°方向），判断其和。以此类推。程序关键是：每填完一个数，看有没有新增加的直线，并判断数字和，不能全部填完19个数再判断，因为计算量太大，程序运行不出来。