开发工具 Informix

在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时，用手动输入的数据，本程序基本上完成了对输入数据进行的快速排序和归并排序!-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!

顺序查找 实现顺序查找的设计与实现 且加上了注释 更容易理解和上手-Find the order of search in order to achieve the design and implementation and the addition of annotations easier to understand and get started

VC下的ADO编程封装类。可灵活方便的应用于VC下的ADO编程-VC under the category ADO programming package. Flexibility can be applied to the VC under the ADO programming

这是一个学生成绩管理系统，运行之后可对学生的基本资料，成绩进行各项操作！-This is a student performance management system, running on students beyond the basic information for the various operating results!

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

电脑设备管理系统,基于ASP开发,功能包括仓存、外发、回收、报废等管理-Computer equipment management system, based on the ASP development, functions including warehousing, outsourcing, recovery, end-of-life management

更新此文件。它在 Excel 文件作为数据库设计的。此文件包括约 4000 字。用户可以访问它，搜索任何单词含义。它包括阿拉伯语-英语单词。

同一个数据库开发的系统，有源代码和发布版本-with a database development systems, and active code releases

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

利用闭散列方法中的线形探查建立散列表。用c实现的。-closed hash method using the linear exploration establish hashtable. C used to achieve.