一个VB小程序,能够进行大数的计算,可以作为学习的参考

常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与逼近、数值积分、常微分方程组的求解、数据处理、极值问题的求解、数学变换与滤波、特殊函数的计算、排序和查找。-Commonly used algorithm of C procedures. Include polynomial terms, complex computation, random number generation, matrix operations, matrix eigenvalue and eigenvector calculations, linear algebra equations, nonlinear equations with the equations, interpolation and approximation, numerical integration, solving ordinary differential equations, data processing, for solving extremum problems, mathematical transformation and filtering, the calculation of special functions, sorting and search.

Integration of the circular restricted three-body problem with burlish stoer routine. Using Numerical recipes in C (routines mmid, bsstep, odeint and pzextr

学C++的同学是不是遇到麻烦了，就是学不懂多态性的呀，我这么有好多实例，那样你就不用担心了-school students encountered trouble is not the means to study the polymorphism understand it, I have so many examples, as you do not have to worry

本程序适用于求解形如f(x)=1/2*x Ax+bx+c二次函数的稳定点 -this procedure applies to solution of the form f (x) = 1/2* x" Ax+ bx+ c quadratic function of the stable point

huffmantr

页面置换算法代码，语言采用c++。实现了FIFO算法，LRU算法，其中，LRU采用经典的LRU算法，由于该算法占用资源较大，多数OS采用改进的LRU算法.-pages replacement algorithm code language used c. To achieve the FIFO algorithm, the LRU algorithm, which, the LRU is a classical LRU algorithm, the algorithm occupy larger resources, the majority of the improved OS LRU algorithm.

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

武汉科技大学计算机数值计算方法全部实验代码，分别是迭代法，拉格朗日迭代法、牛顿迭代法，Romberg法、变步长梯形法，改进的欧拉法、四阶龙格——库塔法，高斯消元法、消去法。原创代码。

按照难度排列，差不多也有80道左右了，代码都很精简，附有注释还有解析神马的，适合初学者参考。

迪杰斯特拉最短路径算法-Floyd shortest path algorithm