（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来...

实现运动员日程安排,可以通过一个二维的矩阵在显示安排除-athletes to achieve the agenda, through a two-dimensional matrix display arrangement

仓库管理系统-Warehouse Management System

数据预测算法，主要是一元n次方程的回归预测实现。* 预测分析--本算法只适用于有明显线性趋势的数据 * 默认为一元二次曲线方程法 * * 本程序主要涉及有两个算法 * 1．用最小二乘原理找到线性方程组的系数和常数。 * 2．解线性方程组 * 本程序在解线性方程组中，由于考虑到收敛性问题未采用迭代法，而是采用Gauss-Jordan消去法来解决。-data prediction algorithm is mainly one yuan n equation forecast to achieve reunification.* Forecast and Analysis-- This algorithm applies only to clear linear trend data* default as a quadratic curve equation method** The procedure involves two main algorithm* 1. Using the principle of least squares linear equations to find the constants and coefficients.* 2. The solution of linear equations* The procedure for solving linear equations, due to convergence problems using iterative method, instead of using the Gauss-Jordan elimination method to solve.

在数据结构中实现两个一元多项式的相加、相减和相乘-In the data structure of the polynomial realize one of the two together, subtract and multiply

每个RFC 3261信息头有一个相应的存取标识. 但是,许多信息头拥有同样的形式。 例如。To和From的信息头都是由显示名和一个URI组成。 To和From信息头用来管理与处理NameAddr实例的. 这个类管理每个信息头类型来负责 解析信息头文本，倘若存储和存取在信息的生存期间,和序列化信息头值为翻译的文本。 下面的表显示了reSIP当前支持的每个RFC信息头的reSIP类型。 reSIP类型是一个SIP信息的信息头调用存取标识作为它的参数的返回类型。-each RFC 3261 header is a corresponding access logo. However, many information first with the same form. For example. To and From the information revealed by the first name and a URI component. To and From the first information for the management and disposal of NameAddr examples. The management of each category of information for the first type of analytical information to the first version, if the storage and access of information in the survival period, and sequence information for the first value of the text translation. The following table shows the current reSIP support of each of the first RFC information reSIP types. ReSIP type of information is a SIP call the first access to information as its logo to the return parameter types.

数据结构课程设计题，用C++语言实现二叉排序数，并对二叉排序数进行，插入，删除，修改等操作-insert delete change

定时备份Oracle数据库和文件的程序 支持RAR压缩功能-Regularly back up Oracle databases and documents in support of RAR compression

北大ACM1003（Hangover）-North ACM1003 (Hangover)

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.

二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal