资源列表
^prime_fac1617337192003
- 素数因子产生器：该程序能生成prime factor-prime factor Generator : the program can generate prime factor
Matrix
- 矩阵综合运算，包括加减数乘，矩阵相乘，矩阵求逆。-Matrix integrated computing, including a few by addition and subtraction, matrix multiplication, matrix inversion.
Gauss-Seidel
- 用Gauss-Seidel求线性方程组的解向量,并给出迭代次数和误差.-Using Gauss-Seidel linear equations for the solution vectors, and give and error iterations.
merge
- 对数据进行排序，并打印出来。为两个有序子序列起始终止位置号赋值-To sort the data, and print them out. Ordered sub-sequences for the two starting position of the termination of assignment No.
xianxingbiao
- 输入以字符串，依顺序表存储，查找一个元素，删除一个元素-Input to a string, depending on the order of tables to store, find an element, delete an element
add
- 运用C++算法完成多项式加法。简单的操作，用链表完成-Done using C++ algorithms polynomial addition. Simple operation, complete with a list
CFD_Jacobi_solver
- Jacobi迭代算法，Fortran编程 中心差分解偏微分方程-Jacobi Iteration
zuidayouhuatouzihuibao
- 最大化投资回报问题：某人有一定的资金用来购买不同面额的债卷，不同面额债卷的年收益是不同的，求给定资金，年限以及债卷面额、收益的情况下怎样购买才能使此人获得最大投资回报。-Maximize return on investment: a person have a certain amount of funds used to purchase the bonds of different denominations, the annual earnings of the different de
greitzer
- 基于fortran的greitzer程序，常微分方程组解法采用经典四阶R-K方法，结果和经典文献进行了对比。-Based fortran greitzer program, ordinary differential equations solution using the classical fourth-order RK method, compared results and classic literature.
array
- array接口，提供了动态数组的接口和实现，内有array.c为实现array.h为接口以及makefile。可在gcc下编译通过-array interface and implementation
CPP
- 素数打表法，高效率。关于多个或者单个素数的高效率判别-Primes play table method, high efficiency. High efficiency on multiple or single primes discrimination
stack_with_min_func
- 定义栈的数据结构，要求添加一个min函数，能够得到栈的最小元素。要求函数min、push、pop的时间复杂度都是O(1)-Defined stack data structure, requires the addition of a min function, it is possible to obtain the smallest element of the stack. Function requires min, push, pop time complexity is O (1)