一个很好的VC代码示例.

对一个文本里的字符进行哈弗曼编码，通过对文本的读取，统计文本里各个字符出现的频数，确定哈弗曼编码，然后将编码在新文本中输出。可进行文本的翻译。

使用基于K-L变换的特征选择方法,使原本4维的特征向量降至3维-KL transform based feature selection method, so that the original 4-dimensional feature vector is reduced to 3-dimensional

acm大赛的试题，希望对狂爱编程的新手有帮助-acm contest questions, in the hope that Cactus have to help novice programmers

摸索了些，关键是几个参数自己一定要选对，否则测量精度大打折扣，定位的时候发现3个节点定位。 ，和n，y位为小数，所以要做相应处理（整数要左移两位） 值要再处理一下。

自己编的一个教师课程匹配程序，实现对教师新学期任课的指派。-their series matching a teacher training program, realized the new semester of teachers assigned to the classroom.

冒泡排序-Bubble sort

常用算法的c语言实现，包括一些经典的比如，最小二乘，插值与逼近等等！-Commonly used algorithm c language, including some classic example, least squares, interpolation and approximation, etc.!

数值分析雅可比迭代法-numerical analysis Jacobi iterative method

ACM一些题目，有一定的难度。不过还能做一些。-ACM Some topics have a certain degree of difficulty. But also to do some.

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