an improved Boyer

精品专家讲述C语言附大量经典实例超值!!!!! ____________^-^___________^-^___________ 程序员必学-quality experts about C language with a large number of classic examples of excellent !!!!! ____________^-^___________^-^______ _____ programmers must learn!

线性表元素删除运算,删除线性表L中第i个位置上的元素-linear elements to delete Table Operational delete Table L linear section i positions on the elements

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research

陷波滤波器（notch filter）算法说明和设计过程，并给出了MATLAB的实现。一个非常好的例程，经过了仔细测试！-Notch Filter (notch filter) algorithm description and design process, given the realization of MATLAB. A very good routines, after careful testing!

企业事务管理系统-Enterprise Management System

KRUSKAL算法-KRUSKAL Algorithm

数 据 结 构 大型 作业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

GoldCoinArray 数据结构与算法 金币阵列问题-Data Structures and Algorithms GoldCoinArray coin problems Array

Delphi 写的 DataSet 导出为Excel 类，不用第三方控件，从CReoprt中切出来，又加工的。

索引文件操作（数据结构）-index file operations (data structures)