WordCount

李春葆的《数据结构教程》教学PPT及书中所有源码，很值得一看！-Li Chun-bao s Data Structure Course Teaching PPT and source book of all, it is worth a visit!

VC编写的读取数据文件的源码-VC compilation reads the fetching according to the document source code

建立家谱文件，可以添加新成员，输出指定家庭的所有成员，确定指定成员在家族中的辈份（第几代），输出指定辈的所有成员-The establishment of genealogy files, you can add new members, the output of all the designated family members, to determine the designated members of the seniority in the family (the first few generations), the output of all the members of the designated generation

本程序实现了哈希表的基本功能，以及一些附带的附属功能，可以作为数据结构的演示程序-the procedures of the hash table to achieve the basic functions, as well as some fringe subsidiary function, can be used as a data structure Demonstration Program

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

这是一个用来管理一个运行系统权限的程序，它增加删除用户，也可修改用户的密码和权限-This is an operating system used to manage a permission procedure, it increases delete users can modify user passwords and permissions

是用回朔法实现跳马程序。数据结构入门的好例子-is back Schomburg Method vault procedures. Structure data entry a good example

设有1000个值在1到10000的整数，试设计一个利用散列方法的算法，以最少的数据比较次数和移动次数对它们进行排序。(with 1,000 in value from 1 to 10,000 integer and try to design a method of using hash algorithm, the minimum number of data comparison and the mobile number of their rank.)

基于决策树和贝叶斯的预测分析器，可以对数据库中的数据集通过训练学习后根据训练结果进行信息预测。-Based on Decision Tree and Bayesian prediction of the analyzer can be in the database data sets through training to learn the results after the training information in accordance with prediction.

今天，小 G 已了解到修理厂共有 m 种不同的修理原料，对于第 i 种原料，可以对任意一个石桥的美化度增加 di，当然这也需要花费 hi 的费用。由于发货场的修理原料有限，对于任意一种修理原料，只有一件，也就是说小 G 只能选择购买和不购买，对于第 i 种修理材料能成功修理第 j 个石桥的条件是：当且仅当 hi ≥ pj，di ≥ vj。现在，已知这 n 个石桥修理的最小花费值，最小美化需求度，以及 m 种修理原料的费用，可对石桥增加的美化度值，请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)