一个VB写的UDP协议的C/S模式的服务程序

单源最短路径算法的C语言实现，刚学算法时写的，多多指教

堆排序 稳定的排序 复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting

利用三元组完成距阵的基本运算,包括加法,减法,乘法.数据结构实习题目-using ternary Group completed the basic matrix operations, including addition, subtraction, multiplication. Internship topic data structure

一共建6个表： 1) 购物表Trade_List（Trade_ID，Product） 2) 频繁一项集Apri

员工培训管理系统。本系统要完成的主要功能是：1.进入系统钱需要身份验证，用户名，密码。输入争取后方可进入。2.管理员可以根据需要定义员工，工作以及部门信息。3.管理员可以定义课程、书籍、教授以及培训的资源信息。4.管理员可以保存员工的培训成绩及员工经过培训之后对该课程和领域的评价。5.依据不同的要求，可以在数据库中对信息进行查询和编辑。-Staff training management system. To complete the system are the main functions: 1. Necessary money into the system authentication, user name, password. Before it can enter into the fight. 2. The administrator can be the definition of necessary staff, as well as the information department. 3. The administrator can define the curriculum, books, professor of information and training resources. 4. The administrator can save the training of its staff after a score and staff training in the areas of curriculum and assessment. 5. In accordance with different requirements, you can on the information in the database query and editing.

我们的作业题，队列和栈函数，对理解这两个概念有帮助-Our operating title, queue and stack functions, understanding these two concepts help

一个有关于VC++6.0与ACCESS数据库的小程序-1 on VC++6.0 and the ACCESS database, a small program

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

一个简单的minisql，能实现sql语句的基本功能，创建、查询和删除，创建索引等-a simple minisql, sql statement to achieve the basic functions to create, search and delete, create indexing

数据结构之对栈的应用之实现各个进制的转换-Data structure on the stack of applications to achieve the various hexadecimal conversion