算法：二分法

有时候迭代法更方便

 

#include <iostream>
#include<cmath>
#include <limits.h>
using namespace std;
//求方程2x^3−4x^2+3x−6=0
double func(double x){
	double res = 2*x*x*x - 4*x*x + 3*x - 6;
	return res;
}


//用迭代法二分能求，用递归法失败！有时候要灵活选择
int main(){
	double lo,hi,eps;
	cin>>lo>>hi>>eps;
	while(lo<=hi && func(lo)*func(hi)<=0){
		double mid = (lo+hi)/2;
		if(fabs(func(mid))<eps){
			cout<<mid;
			return 0;
		}
		else if(func(lo)*func(mid)<=0){
			hi = mid;
		}
		else if(func(hi)*func(mid)<=0){
			lo = mid;
		}
	}
}