龙贝格积分法求解数值积分

C++编写高斯消去法求解线性方程组，将程序include到主程序，然后建立Guss对象，求解可得到最终解，奇异矩阵将会出错！

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

这个源代码是为 3 G 或 2 G 网络与非视距无线定位算法的源码。欢迎大家下载、使用。

大数相乘，可以解决超过大整数的问题-multiply large numbers, can be resolved over the issue of large integer

用最小二乘法解决实际问题，如曲线拟合，插值分析，-Least square method in solving practical problems, such as curve fitting, interpolation analysis

刚才弄错了，这才是第二个源码，可以实现输入一二叉树的前序与中序，输出其后序-have just made a mistake, this is the second source, can achieve an input sequence of binary tree with the sequence, then the output sequence

科学计算中的共轭梯度法解对称正定线性方程组.-Scientific Computing in the conjugate gradient method symmetric positive definite solution of linear equations.

快速查找：应用递归排序的例子- Quick look: Application recursion arrangement example

A Fraction class that has the ability to add, subtract,multiply and divide .

大数加法、减法、乘法和除法的C语言实现源码，可以帮助实现大数运算。-Addition of large numbers, subtraction, multiplication and division of the C language source code that can help realize computation of large numbers.