优化设计的程序，包括一位搜索，及无约束搜索方法

北大ACM试题poj 第3068题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3068 question Question poj source code, good code, and want to help students engage in ACM

模拟堆栈进栈和出栈操作的两个C++源程序-simulated stack into stacks and stacks up operation two C source

绘制螺纹的MATLAB程序，对于生成螺纹管等几何体较为重要-A MATLAB program can draw bolt pattern, and is more important to produce bolt pattern pipe and other geometry body

用For/Next循环语句编写程序计算自然对数之和，并要求先定义求a到b的自然对数之和的函数为Nlogarithm(a,b),然后单击“求自然对数之和”按钮时调用该函数。

ASCII数据块显示-ASCII data block shows

acm中划分凸边行算法-acm were divided into convex side trip Algorithm

快速排序算法,很好用,用c++编,拷贝在文本里,大家可以参考参考哦.-quick sort algorithm is useful, with c writers, copy in the text, one can refer to Reference oh.

正整数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

粒子群优化算法（c++版）-PSO algorithm (c version)

图像压缩算法的一种，主要用于JPEG标准的图像压缩，是学习图像压缩必备技能。本源码采用C语言对图像数据进行DCT和IDCT变换，比较简单易懂，适合刚接触图像压缩算法的初学者。