bisection.cpp

二分法求解方程

#include <iostream.h>
#include <math.h>

const double e = 2.7182818;
void main()
{
	double a, b, p, s, q;
	//a = -1, b = -0.1, s = 0;
	a = 10, b = 20, s = 0;
	//cout << (32.17/2) * (((1/e - e) / 2) + sin(1)) + 1.7<< endl;
	int i = 0;
	while(i <= 16){
		p = (a + b) / 2;
		q = 0 - p;
		//s = ((32.17/2) / (p*p)) * (((pow(e,p) - pow(e,q)) / 2) - sin(p)) + 1.7;
		//s = 600*p*p*p*p - 550*p*p*p +200*p*p - 20*p - 1;
		s = 0 - (sqrt(900 - p*p))/8 + (sqrt(900 - p*p))/(sqrt(400 - p*p)) + 1;
		cout << i << " " << a << " " << b << " " << p << " " << s << " " << (b - a) / 2 << endl;
		cout << endl;
		i ++;
		if(s > 0){
			b = p;
			continue;
		}
		else {
			a = p;
			continue;
		}

	}
}