小龙虾

#include #include #include using namespace std;int main(){ clock_t start,finish; long x=1,a[100000],i,j,s=0,t; for(i=0;i<100000;i++) a[i]=i+1; start=clock(); for(i=0;

#include #include #include #include using namespace std;double max(double x[],int n){ double max_=abs(x[0]); for(int i=1;i<n;i++) if(abs(x[i])>max_) max_=abs(x[i]);

#include #include #include using namespace std;double f(double x){ return log(4-x)/2;}int main(){ double x=1,y; int count=1; do { y=f(x); printf("%-3d: ",co

#include #include #include using namespace std;double f(double x){ return log(4-x)/2;}int main(){ double x=1,x1,x2,y; int count=1; do { x1=f(x); x2=f(x1);

#include #include #include using namespace std;double f(double x){ return exp(2*x)+x-4;}double f1(double x){ return 2*exp(2*x)+1;}int main(){ double x=1,y; int count=1;

#include #include #include using namespace std;double f(double x){ return exp(2*x)+x-4;}int main(){ double a=0,b=1,x; int count=1; do { x=b-f(b)*(b-a)/(f(b)-f(a));

#include #include #include #include using namespace std;double max(double x[],double y[],int n){ double max_=abs(x[0]-y[0]); for(int i=1;i<n;i++) if(abs(x[i]-y[i])>max_)

#include #include #include #include using namespace std;double max(double x[],int n){ double max_=abs(x[0]); for(int i=1;i<n;i++) if(abs(x[i])>max_) max_=abs(x[i]);

x=[1 2 3 4 6 7 8];y=[2 3 6 7 5 3 2];p=polyfit(x,y,2);plot(x,y,'bo');hold on;x=0:0.01:10;y=p(1)*x.^2+p(2)*x+p(3);plot(x,y,'r');