数据结构》的全部代码实现（C语言）,配合《数据结构》算法实现及解析使用。...

实现B-树的创建、插入、删除、遍历等功能，并以层序方式通过程序台显示输出。-B-tree to achieve the creation, insertion, deletion, traversal functions, and to sequence through the procedure showed that the output of Taiwan.

这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再vc中运行.-This is a use of a variety of data sequencing procedures for ordering, scheduling time complexity of small, space complexity of small, fast order. Compressed including source files, then vc run.

网上购物数据库，所有代码都有，包括模型图 -Online Shopping Database

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

经典c程序100 每个都可以运行 内有目录-Classic c program 100 can run each of directories within the

同样具 体引退台与与与土他 与体引退台与与与同同样具体引退台与与与土他与土他与 土他与 -same with the same specific retire with Taiwan and with the soil and soil his body and he retire with Taiwan and the same with concrete and retire with Taiwan and with the soil and soil samples with specific units and retire with his Turkish soil with soil with soil and he

LNMF是基于“局部”非负矩阵分解生成特征空间的算法，而NMF是基于非负矩阵分解。-Matrix is based on a "partial" non-negative matrix factorization generation features space algorithm, which is based on the NMF non-negative matrix factorization.

在java中链接数据库，代码量不多，但是麻雀虽小，五脏俱全！-in which links database, code volume is small, sparrow is small, perfectly formed!

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

用于建筑的测斜数据处理!把测试设备的数据下载电脑,通过本系统进行分析,然后生成所需要的数据!-For construction of the inclinometer data processing! The test equipment data download computer, through an analysis of the system, and then generate the data needed!