有趣的小程序(螺旋矩阵输出)

采用的是回溯法和分支限界的思想求解迷宫问题                                                         

堆排序算法的实现,不错的哦-heap sorting algorithm to achieve good oh

FFT和FIR 快速傅里叶变换和FIR滤波器实验程序-Fast Fourier Transform FFT and FIR and FIR filter experimental procedure

自己编写的，SAT问题的Johnson算法源代码，请多多指教-I have written, SAT question of the Johnson algorithm source code, please advice

资源描述 Code128 Code39 两种编码规则的条形码，数字变成条形码的转换方法。 // TODO: Add your control notification handler code here CDC dc; int CodeName,printQuality; LPSTR partial=NULL,text; CCode39 code39; CCode128 code128; UpdateData(TRUE); text=m_CodeText.GetBuffer (50); //获取编码方式 CodeName=m_CodeName.GetCurSel(); if(CodeName==CB_ERR) { MessageBox("请选择编码方式"); return; } switch(CodeName) { case 0: CodeType=CODE39; break; case 1: CodeType=CODE128A; break; case 2: CodeType=CODE128B; break; case 3: CodeType=CODE128C; break; } //获取打印机设备环境 if(!(printDlg.DoModal())) { MessageBox("打印错误。"); return ; }

用拉格朗日插值公式，对给定的n用离散数据进行插值计算。-Lagrange interpolation formula, the right to use discrete n data interpolation.

目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子，你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确，如果盘子只有两三个，是很容易解决的。但是随着盘子数目的增加，问题就变得非常难解了。 -purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it"s very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.

爬墙机器人算法的的Python实现，带有GTK图形界面。算法描述如下：当没有墙时，机器人默认向东方移动，触墙后，根据设计的状态机进行方向的转移。该算法可以通过一般的地图测试。

八数码多个算法-more than eight digital algorithm

进行模糊控制逻辑运算，输入为误差和误差变化率，采用三角形隶属函数进行模糊化，采用最大最小法进行模糊推理，采用重心法进行去模糊化。