-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathBisectionMethod2.cpp
117 lines (89 loc) · 1.83 KB
/
BisectionMethod2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<iostream>
#include<iomanip>
#include<math.h>
using namespace std;
float compute(int a[],int deg,float value);
float absu(float f);
int main()
{
float result;
int degree;
cout<<"Enter the degree of the eqn\n";
cin>>degree;
int a[degree+1];
int temp=degree;
while(temp>=0)
{ cout<<"Enter the coeff of x^ "<<temp<<endl;
cin>>a[temp];
temp--;
}
float left,right,m;
int accuracy;
cout<<"Enter accuracy\n";
cin>>accuracy;
float arr=pow(10,-accuracy);
cout<<"\n"<<arr;
do
{
cout<<"Enter left and right limit respectively:\n";
cin>>left>>right;
}while(compute(a,degree,left)*compute(a,degree,right)>=0);
if(compute(a,degree,left)>compute(a,degree,right))
{
float temp;
temp=left;
left=right;
right=temp;
}
float temp1;
do
{
m=(left+right)/2;
result=compute(a,degree,m);
// cout<<" M is:"<<m<<"\n";
if(result>0)
{
right=m;
}
else
left=m;
temp1=compute(a,degree,(right+left)/2);
cout<<"Temp is:" <<m<<endl;
}while(absu(result-temp1)>arr);
cout<<"Answer is :"<<m;
return 0;
}
float compute(int a[],int deg,float value)
{
int temp=deg;
float result=0;
while(temp>=0)
{
result+=a[temp]*pow(value,temp);
temp--;
}
return result;
}
float absu(float f)
{
if(f>0)
{
return f;
}
else
{
return -f;
}
}
/*float compute(float left,float right,float a,float b,float c,float x)
{
float m=(left+right)/2
float result=quad(a,b,c,x);
if(result>0)
{
right=m;
}
else
left=m;
return m;
}*/