hexadecimal-conversion

有2*n个盒子排成一行，其中有两个相邻的空盒，有n-1个盒子有符号 A ，有n-1个盒子有符号 B 。例如，n=5，并有初始配置如下： A B B A . . A B A B (2* n box row, wherein there are two adjacent empty box, n-1 of a box with the symbol ' A' , the symbol ' B' n-1 th box. For example, n = 5, and the initial configuration is as follows: ABBA .. ABAB)

非常经典的C++程序，十分实用对于练习程序来说。(good programme)

一个电梯模拟程序。 该程序模拟两个电梯的运作情况。（程序会随机生成电梯选择任务以及超重提示）(An elevator simulation program. The program simulated the operation of the two elevators. (Procedures are randomly generated elevator prompted to choose the task, as well as overweight))

线性表的创建 删除 查找 插入 输出等功能(linearlist create delete find insert print)

button按下后，edit控件内容连续变化，button抬起后edit内容停止变化。自己做的例子，只以int数据为例。(button is pressed, edit control content changes continuously, button lift stops changing after edit content. Own example, an int data as an example only.)

用引用的方法求二维数组的最大值及其下标,谭浩强书上的(Use the methods to controls.)

VC++从DLL中获得资源的小实例源代码，从DLL中获得背景图像，可者是一个图标资源或是其它类型的文件，总之，学会了一种，就可以举一反三，灵活掌握了。(VC++ from the DLL resources, source code examples to get a background image from the DLL, can an icon resource, or other types of documents, in short, learned, you can learn by analogy, flexibility.)

遗传算法解决TSP旅行商问题（可计算30个城市），用Visual C++编写，希望对大家有所帮助。(Genetic algorithm to solve TSP traveling salesman problem (calculate 30 cities), written in Visual C++, we want to help.)

分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)

实现高斯滤波等功能，适合VC初学者，可通过代码了解滤波原理。(Gaussian filter functions for VC beginners, filtering through the code to understand the principle.)