source database.

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

数据结构哈希表的实现，用C++写的，比较完整-Hash table data structure to achieve, using C++ Written relatively complete

基于面向对象的数据库编程-based on the object-oriented database programming

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

此类可以生成和检查短哈希值。

wince扩展数据库编程中利用ADO访问Access数据库-wince extended database programming using ADO to access Access database

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-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.

delphi中使用ADO的源代码-use of the source code for ADO

Java数据结构的小应用程序对于数组的冒泡排序-data structure of the Java applications for small array of Bubble Sort

数据结构中关于二叉树的基本操作 包括其各种函数-Binary tree data structure on the basic operation of a variety of functions, including its