Matrix_Designer的专栏

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float *a,x,result=0;<br />int n;<br />float qin(float a[],int n,float x);<br />do<br />{<br /> cout<<"输入多项式的次数：";<br /> cin>>n;<br />}while(n<1);<br />

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,j,n;<br /> float **a;<br />void guass(float **a,int n);<br />cout<<"请输入方程次数:";<br />cin>>n; <br />a=new float*[n];<br />for(i=0;i<n;i++)<br /> a=new float[n+1];<br />

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,j,n;<br /> float **a;<br />void catchwith(float **a,int n);<br />cout<<"请输入方程次数:";<br />cin>>n; <br />a=new float*[n];<br />for(i=0;i<n;i++)<br /> a=new float[5];<br

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,j,n;<br /> float **a,*x,e;<br />void jacobi(float **a,float *x,float e,int n);<br />cout<<"请输入方程次数和要求精度:";<br />cin>>n>>e; <br />a=new float*[n];<br />x=new float[n];<br

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,j,n;<br /> float **a;<br />void jordan(float **a,int n);<br />cout<<"请输入方程次数:";<br />cin>>n; <br />a=new float*[n];<br />for(i=0;i<n;i++)<br /> a=new float[n+1];<br /

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float x0,result,e;<br />float u(float x);<br />float aitken(float (*f)(float),float x0,float e);<br />cout<<"输入初始值：";<br />cin>>x0;<br />cout<<"输入精度：";<br />

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float x0,y0,h,**result;<br />int N;<br />float f(float x,float y);<br />void runge_kutta(float (*f)(float,float),float,float,int,float,float **result);<br />co

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float a,b,e,result; <br />float f(float x);<br />float guass(float (*f)(float),float a,float b,float e);<br />cout<<"输入端点：";<br />cin>>a>>b;<br />cout<<"输入精度

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float x,e,result; <br />float f(float x);<br />float romberg(float (*f)(float),float x,float e);<br />cout<<"输入自变量值：";<br />cin>>x;<br />cout<<"输入精度：";<br />

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,n;<br /> float **a,x;<br />float three(float **a,int n,float x);<br />cout<<"请输入点的个数:";<br />cin>>n; <br />a=new float*[n];<br />for(i=0;i<n;i++)<br /> a=new float[2]

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float a,b,e,result; <br />float f(float x);<br />float romberg(float (*f)(float),float a,float b,float e);<br />cout<<"输入端点：";<br />cin>>a>>b;<br />cout<<"输入

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float **a,x,result,e; [url=file://保/]file://保[/url]存精度<br />int n,i;<br />float aitken(float **a,int n,float x,float *e);<br />cout<<"输入点数：";<br />cin>>n;<br

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float **a,x,result;<br />int n;<br />float k,b;<br />void smallest(float **a,int n,float *k,float *b);<br />cout<<"输入点数：";<br />cin>>n;<br />a=new float *[

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float **a,result;<br />int n,i;<br />float hls(float **a,int n);<br />cout<<"输入行列式的阶数：";<br />cin>>n;<br />a=new float *[n];<br />for(i=0;i<n;i++)<br />

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float a,b,e,result; <br />float f(float x);<br />float exfloor(float (*f)(float),float a,float b,float e);<br />cout<<"输入端点：";<br />cin>>a>>b;<br />cout<<"输入

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float x0,y0,h,**result;<br />int N;<br />float f(float x,float y);<br />void adams(float (*f)(float,float),float,float,int,float,float **result);<br />cout<<"输

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float a,b,result; <br />int n;<br />float f(float x);<br />float simpson(float (*f)(float x),float a,float b,int n);<br />cout<<"输入端点：";<br />cin>>a>>b;<br /

<br />#include "iostream.h"<br />void main()<br />{ <br />int i,j,n;<br /> float **a,e;<br />void gaussSeidel(float **a,float e,int n);<br />cout<<"请输入方程次数和要求精度:";<br />cin>>n>>e; <br />a=new float*[n];<br />for(i=0;i<n;i++)<br />

<br />#include <iostream>using namespace std;void main(){float a,b,e,result;float divice(float (*f)(float),float a,float b,float e);float f(float x); cout<<"输入区间端点：";cin>>a>>b;cout<<"输入精度：";cin>>e;result=divice(f,a,b,e);cout<<"运行结果：

<br />#include <iostream><br />using namespace std;<br />void main()<br />{<br />float **a,x,result;<br />int n,i;<br />float lglr(float **a,int n,float x);<br />cout<<"输入点数：";<br />cin>>n;<br />a=new float *[n];<br />for(i=0;i<n;i++)<b

#include <iostream><br />using namespace std;<br />void main()<br />{<br />float x0,result,e;<br />float f(float x);<br />float f1(float x);<br />float newdon(float (*f)(float),float (*f1)(float),float x0,float e);<br />cout<<"输入初始值

    因为有项目需要，要做一个类似ispell 的软件，其中会产生大量的对单词的查找操作，于是经过一翻研究，得出以下HASH算法，经过验证比一般的查表的FNV HASH算法产生的分布曲线基本没什么两样，并且在大部分的不同字典下，本算法要比查表的FNV HASH算法表现出速度更快，分布更均匀。但是因为是实验结果，所以暂时还没得出有效的数学推论，但是从大量的不同的字典测试数据来看，此算法确实效率不错。    由于以前没有涉及过相关的纯算法的设计，所以刚刚开始的时候，打算随便选用一种HASH，比如说用%除大质数