求最大公约数和最小公倍数的程序，输入两个数，能求出最大公约数和最小公倍数...

二叉排序树，包括插入节点、删除节点、中序线索化、中序遍历等功能-Binary sort tree, including the insert node, delete node, in the sequence of clues, in the traversal functions

外部排序的所有算法，在TC下经过调试，与吴伟民数据结构课本完全一致，用C实现-all external sorting algorithms, the TC under after debugging, and data structure Xiulan WU Weimin textbooks entirely consistent with achieving C

电梯模拟系统，电梯端和管理员端通过网络连接-Elevator simulation system, elevator client and the administrator client through a network connection

本程序应用VC6.0来编程制作信息共享系统，实现信息管理功享的自动化．本例子采用DAO数据访问方式，采用Access2000作为数据源．-VC6.0 the application process to produce programming information sharing system, information management enjoyed by the successful automation. The examples used DAO data access methods that Access 2000 as a data source.

实现运动员日程安排,可以通过一个二维的矩阵在显示安排除-athletes to achieve the agenda, through a two-dimensional matrix display arrangement

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

数据结构（C＋＋版）的演示程序，详细演示广度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the breadth- first search specific call process,

这是ID3决策树算法的一个示例实现

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt

快速排序 基本思想：通过一趟排序，将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录进行排序，以达到整个序列有序-Basic idea of quicksort: sort through the trip, will be to sort records is separated into two independent parts, some of which are recorded in another part of the record than keyword keyword small, then the two were part of the record sort, so as to achieve the entire sequence of orderly