BFS, DFS, to the map, no map to the realization of the algorithm can be automati...

实时曲线类的改进增加功能: 1)采样数据存盘和加载 2)演示程序中可以实现图形的打印预览和打印功能,曲线从原点开始-Improvement of real-time curve of increasing the number of functional categories: 1) sampling data to disk and load 2) presentation graphics program can print and print preview function, curve from the origin to start

对ACCESS数据库进行读写操作的VC代码-right ACCESS database and write the code VC

ASP+ACCESS 的东西，请看下。我很想下载点东西。谢谢了。-ASP+ACCESS

在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时，用手动输入的数据，本程序基本上完成了对输入数据进行的快速排序和归并排序!-in the process of the rapid sequencing and merging the two sorting algorithms are correct for the test, with the manual input of data, the procedure is basically completed the data entry for the rapid sequencing and merging order!

对数据模板窗体的制作与应用说明。by the DbNavigation Database record Add, Delete and so on-template forms of data production and application notes. By the record DbNavigation Database Add, Delete and so on

连接oracle的java库- Connects oracle the java storehouse

Visual Basic开发的 家庭收支管理系统后台数据库Acce-Visual Basic development of the household income and expenditure management systems background database Acce

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword

和尚挑水问题（文件内有详细解释） 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of

使用powerbuilder开发的小型超市管理系统。 请查阅。-Use PowerBuilder to develop a small supermarket management system. Please check.