快速排序 基本思想：通过一趟排序，将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录进行排序，以达到整...

数据结构中所有算法的实现，清华大学小严辞C语言版本-data structure of the algorithm to achieve all Qinghua small C-language version of the biblical

用ado连接数据库access的详细代码（可能还有一些功能有待完善，大家可以互相交流啊）-Database access using ado connection code details (and possibly some of the features remain to be improved, we can exchange ah)

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

跟数据库密切相关的各种典型操作VC例程源代码，比较常见的操作都有。-closely with the database related to the operation of a typical VC routines source code, the more common operations have.

数据结构作业－停车场管理-operating data structure-the car park management

可实现科研信息管理系统的功能,有项目管理,教师管理,科研项目管理等多项内容-Research and information management can realize the function of the system, have project management, teacher management, research management, and so a number of content

马周游问题代码，走日字形的马在 一个棋盘-Ma tour problem code

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree

MaxHeap operation like insert and delete

数据结构：顺序表-data structure : the order form