simp_test.c

包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的3个典型算法加演示。

/*test.c*/
#include<stdio.h>
#include<math.h>
#include"simp.h"
double fun4(double x)
{
	double y;
	y=log(1.0+x)/(1.0+x*x);
	return(y);
}

double fun3(double x)
{
	double y;
	y=exp(x)/(4.0+x*x);
	return(y);
}

double fun2(double x)
{
	double y;
	y=sin(x)/x;
	return(y);
}

double fun1(double x)
{
	double y;
	y=sqrt(4.0-sin(x)*sin(x));
    return(y);
}

void main()
{
	int n;
	double a,b,t11,t12,t3,t4,t2;
	double eps;
	eps=0.0000001;
	a=0.0;//左区间
	b=1.0;//右区间
	printf("请输入需要等分的区间数n=");
	scanf("%d",&n);
	t11=T_fun(n,0,0.25,fun1);
	printf("\n复化梯形求解积分(1):  t11=%e\n",t11);
	t12=simpson(n,0,0.25,fun1);
	printf("\n再复化辛普森求解积分(1):  t12=%e\n",t12);
	t3=simpson(n,a,b,fun3);
	printf("\n复化辛普森求解积分(3):  t3=%e\n",t3);
	t4=romberg(a,b,eps,fun4);
	printf("\n龙贝格求解积分(4):  t4=%e\n",t4);
    
	
}