这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现...

利用栈和队列完成停车场的管理,数据结构的实习题目,并完成选做内容-use stack and queue complete parking management, and data structure of the internship topics, and complete the election to content

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged straight intersection

本程序是一个用于管理学生成绩例子．通过利用MFC的DAO类，用VC++编写独立与DBMS的应用程序-this is a procedure for the management of the performance of their students examples. Through the use of the MFC DAO category, prepared by VC independence and DBMS applications

1 2 0.0403 1 3 0.4747 1 4 0.7015 1 5 0.7936 1 6 0.2973 1 7 0.6139 1 8 0.4494 1 9 0.3155 1 10 0.8558 1 11 0.272 1 12 0.1045 1 13 0.6548 1 14 0.9271 1 15 0.3229 2 1 0.2182 2 3 0.9329 2 4 0.9521 2 5 0.8128 2 6 0.4044 2 7 0.6619 2 8 0.6596 2 9 0.3007 2 10 0.7244 2 11 0.2316 2 12 0.01 2 13 0.915 2 14 0.0878 2 15 0.0984 3 1 0.967 3 2 0.8945 3 4 0.749 3 5 0.9038 3 6 0.3022 3 7 0.2 3 8 0.7532 3 9 0.042 3 10 0.1991 3 11 0.8995 3 12 0.0592 3 13 0.4332 3 14 0.3324 3 15 0.17 4 1 0.434 4 2 0.3857 4 3 0.5991 4 5 0.5404 4 6 0.7573 4 7 0.96 4 8 0.8047 4 9 0.5279 4 10 0.1573 4 11 0.9087 4 12 0.3227 4 13 0.2898 4 14 0.5262

这是VC++操作EXCEL的一个例子，希望对大家有所帮助-this is a example of operate EXCEL with VC++,hope helpful to you!

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

一个能求图中任两顶点之间的最短距离的程序-seeking a map to the two vertices of the shortest distance between the procedures

有关启发式搜索的经典算法：A*最短路径算法的实例和对应程序。关注的朋友可以留意一下。（比传统的Dijistra算法效率高很多哦！^_^）-the heuristic search algorithm of the classic : A* shortest path algorithm examples and the corresponding procedures. Concerned friends can look. (Dijistra than the traditional algorithm efficiency is much higher oh 70,000

通用的条码打印程序-common barcode printing program

图书馆