Verilog数字积分法2轴插补

改进的蚁群算法程序-improved program of ant conoly algorithm

vc++工程，计算快速傅立叶变换的源程序。-vc++ engineering, computing Fast Fourier Transform of the source.

各种排序算法小结-various sorting algorithm Summary

此代码使用蚁群优化方法来解决TSP问题，欢迎下载，试用。谢谢大家的支持。

讲述了辨识的一些基本概念和基础知识，用经典辨识方法和最小二乘法进行辨识及对应的控制算法-Tells the story of the identification of some basic concepts and knowledge base, with classical identification method and least-square method for identification and corresponding control algorithm

把整数华氏温度转换成浮点数摄氏温度,精确到三位数字-put into Fahrenheit temperature float Celsius temperature, accurate to three figures

正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如，1，2，5，10 都是正整数10 的约数，且div(10)=4。设a 和b 是2 个正整数，a≤b，找出a 和b之间约数个数最多的数x。 对于给定的2 个正整数a≤b，编程计算a 和b 之间约数个数最多的数。 数据输入 输入数据由文件名为input.txt的文本文件提供。文件的第1 行有2 个正整数a和b。 结果输出 程序运行结束时，若找到的a 和b 之间约数个数最多的数是x，将div(x)输出到文件output.txt中。 输入文件示例 输出文件示例 input.txt output.txt 1 36 9 -Positive integer x can be about a few of the positive integer x divisible. Positive integer x the approximate number recorded as the number of div (x). For example, 1,2,5,10 are about 10 positive integer number, and div (10) = 4. Set a and b are two positive integers, a ≤ b, to find a and b between about a few number of the largest number of x. For a given two positive integers a ≤ b, Programming calculated a and b between about a few number of the largest number. Data entry input data from the document text file named input.txt provide. File line 1 has two positive integers a and b. The results run the end of the output, if found between a and b of about a few number o

等值线插值Pascal程序-contours Pascal interpolation procedures

实现数学中的warshall算法，既完成对传递闭包的求解-To achieve in mathematics warshall algorithm, both to complete the transitive closure of the solution