-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPolynomial.java
97 lines (40 loc) · 1.07 KB
/
Polynomial.java
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
import java.util.Arrays;
//import java.util.Arrays;
import java.lang.Math;
public class Polynomial {
public double[] coefficients;
public Polynomial() {
double[] array= {0,0,0,0,0,0,0};
this.coefficients=Arrays.copyOf(array,array.length);
}
public Polynomial(double[] array){
this.coefficients=Arrays.copyOf(array,array.length);
}
public Polynomial add(Polynomial p){
Polynomial p2=new Polynomial();
for(int i=0;i<p.coefficients.length;i++){
p2.coefficients[i]+=p.coefficients[i];
}
for(int i=0;i<this.coefficients.length;i++) {
p2.coefficients[i]+=this.coefficients[i];
}
return p2;
}
public double evaluate(double x){
int lengthPolynomial=this.coefficients.length;
double sum=0.0;
for(int i=0;i<lengthPolynomial;i++){
sum+=this.coefficients[lengthPolynomial-i-1]*Math.pow(x,(lengthPolynomial-i-1));
}
return sum;
}
public boolean hasRoot(double y){
double temp=this.evaluate(y);
if(temp==0.0){
return true;
}
else{
return false;
}
}
}