一个很好的员工信息管理系统

一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"

和尚挑水问题（文件内有详细解释） 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of

最小生成树算法 克鲁斯法尔算法 球最佳路径-kulru method class maiun void cx

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

项目管理中,按科目交叉取数报表按科目交叉取数报表-Project management, cross-check the number of subjects according to statements by the subjects cross-check the number of statements

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

C++数据结构树结构类定义及有关算法-C data structure tree structure type definition and the algorithm

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

][String]有多种方法可以使整个字符串排列，（不重复）整个数组，还有字典方法

数据库课程设计工程项目管理系统 仅供参考-curriculum design database management system project is for reference only