将一个5*5的矩阵中最大的元素放在中心，四个角分别放四个最小的元素（顺序从左到右，从上到下顺序依次从小到大存放）...

此功能实现在白板中画椭圆图形!类似Windows的画图模板,还需要完善，请下载来完善它-achieve this function draws the whiteboard elliptical graphics! Windows drawing similar template, we must also perfect, download it to improve

目前在网上有一个CPictureEx类，用于加载GIF动画，不过该类是mfc封装类，对于不使用mfc的c++程序员来讲，不能使用。为了让该类能够让更多的人方便的使用，使其不再被局限于MFC，本人花时间改造了一下这个类，改造后，该类可以应用于任何MFC、 WTL/ATL及其它WINDOWS API编程。 　　由于原来的CPictureEx是继承于CStatic类，本人改造后，在CPictureEx中直接封装了一个窗口句柄HWND。 　　假设您在一个弹出式Dialog对话框中加载gif动画，您要做的就是在对话框中放一个控件，可以是BUTTON、STATIC等等。假设您加的这个控件的ID是IDC_FLASH，您的对话框窗口句柄是hDlg，则要使用CPictureEx，将非常简单。详情参见源代码。-present on the Internet which is a CPictureEx category for loading GIF animation, But such is mfc Packaging category for the non-use of the c mfc speaking programmers, which can not be used. To allow such to allow more people to use, it will not be confined to the MFC. I spend time on this transformation of the type that after transformation, and these can be applied to any MFC. WTL/ATL and other Windows API programming. As the original CPictureEx inherited from CStatic category, I transform, In CPictureEx directly Packaging a window handle HWND. Suppose you in a pop-up dialog box loaded Dialog gif animation You need to be done is up in a

有关Com的演示程序-Com on the demonstration program

Dijistra最短路径 邻接巨阵结构 c-Dijistra shortest path adjacent structure c Cell Array

无组件文件上传，可免除fso控件；移植性强。-No file upload component, can be exempted from controls fso strong transplantation.

参考文章 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic Algorithm article reference Darwin" s theory of evolution is based on an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely applied in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

x选用lzw编码的一个完整程序 有压缩率和字典显示 功能全-x 4,558,302 choice of a complete coding procedures compression rate and display the entire dictionary

c++五种排序算法-5 methods of sorting algorithm with C++

采用数据结构中的AOE方法对图的关键路径进行计算，此算法摘录了课本中的算法-using the data structure to map AOE method of calculation of critical path, this algorithm extracts from the books of Algorithm

本程序为32阶幻方的一种，在左上角的4*4=16个空格中，第一、三行的第1，2个空格标记*，第二、四行的第3，4个空格标记*。然后分别以轴对称、中心对称扩展到另三个区域的256个空格的左上方1/4区域，然后又以轴对称、中心对称扩展到256个格的其它三个区域,依次类推直至整个区域的1024个空格中对应的 空格均有标记*。-procedures for the 32 bands a magic squares in the upper left corner of the 4* 4 = 16 spaces, the first and the first three rows 1,2-box labeled*, second, the first four lines of 3,4* 000 box labeled. Then axisymmetric respectively, the Center symmetric extension of another three regional 256 spaces in the upper left 1/4 regional, then, axisymmetric, the Center symmetric extension of the 256 grid other three regions, a total of 444 throughout the region until 1024 the corresponding blank spaces are marked*.