c++写的一个关于数据结构的苹果纠纷的数学问题,相信会给喜欢数据结构的朋友们带来帮助!...

基于决策树和贝叶斯的预测分析器，可以对数据库中的数据集通过训练学习后根据训练结果进行信息预测。-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.

Program in FoxPro that creates a database and a management interface to the database. Similary to a store database.

次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm

DO交易三皇代码。其中三皇位置必须摆放在包裹栏第一页的第一排中，否则代码无法识别，请务必清楚。令由于该代码采用wpe封包模式，使用wpe封包发送时可选择为连续发送，待游戏提示FAIL ITEM时即可停止，否则服务器将接受大量无效命令。

堆栈操作，用来实现大树精确加法，可以任意数的位数-stack

VFP图书馆管理系统-VFP Library Management System

一元稀疏多项式计算器的基本功能是： (1)输入并建立多项式； (2)输出多项式，输出形式为整数序列：n,c1,e1,c2,e2,….,cn,en, 其中n是多项式的项数，ci和ei分别是第I项的系数和指数，序列按照指数降序排列； （3）多项式a和b相加，建立多项式a+b （4）多项式a和b相减，建立多项式a-b.-Sparse Polynomial calculator a dollar a basic function is to: (1) input and the establishment of polynomials (2) the output polynomial, the output sequence of the form of an integer: n, c1, e1, c2, e2, ...., Cn , en, in which n is the number of polynomial, ci and ei, respectively, is the first I of the coefficient and index, sequence in accordance with the index in descending order (3) polynomials a and b are added together to establish polynomial A2B ! b (4) polynomials a and b-phase reduction, the establishment of polynomial ab.

this is my first software.

一个合并排序算法。是按照《算法导论》书中的讲解来写的。-A plan to merge sorting algorithm. In accordance with the

这是我上数据结构和算法课程是老师的课件 所有算法都用c++实现拉 .比用伪代码描叙要 好得多-on data structures and algorithms is the teacher"s curriculum courseware all algorithms are used to achieve c Rafah. Pseudo code than depicts much better