将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。...

数据预测算法，主要是一元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.

SQLSERVER源代码-SQLSERVER source code

我自己编写的一个C++ kruskal最小生成树程序，希望可以对初学者有所帮助，错误难以避免，希望大家谅解 -I have written a C++ Kruskal minimum spanning tree procedure, hoping to be helpful for beginners, it is difficult to avoid errors, I hope everyone understanding

资源描述 介绍opencv特有的数据结构cvmat，可用作opencv的作图，图像成分分析   

又一个c++委托（函数对象）模板类的实现-Another c++ Commissioned (function object) template class realize

机器学习的基础在于分类与聚类，此处分享三种聚类算法，matlab平台

数据结构课程设计,表达式,用C语言实现,难度系数较高-data structure curriculum design, expression, using C language, the higher the coefficient of difficulty

数据结构的一些简单编程题,二叉树结构，遍历的递归于非递归算法-data structure that some simple programming, binary tree structure, traverse the non- recursive recursive algorithm

车辆管理-vehicle management

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.