-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGroup.java
196 lines (165 loc) · 4.06 KB
/
Group.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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
public class Group {
public static class Kelas{
public double bawah;
public double atas;
public double frek;
public Kelas(double bawah, double atas, double frek){
this.bawah = bawah;
this.atas = atas;
this.frek = frek;
}
public double panjang(){
return atas-bawah+1;
}
public double xi(){
return (atas+bawah)/2;
}
public double tb(){
return bawah-0.5;
}
public double ta(){
return atas+0.5;
}
public double fiXi(){
return frek*xi();
}
public double deltaMeanXi(double mean){
return Math.abs(mean-xi());
}
public double deltaMeanXiFi(double mean){
return deltaMeanXi(mean)*frek;
}
public double sqDeltaMeanXi(double mean){
double deltaMeanXi=deltaMeanXi(mean);
return deltaMeanXi*deltaMeanXi;
}
public double sqDeltaMeanXiFi(double mean){
return sqDeltaMeanXi(mean)*frek;
}
}
public static class DataBerkelompok{
public Kelas[] kelas2;
public boolean sampel;
public DataBerkelompok(Kelas[] kelas2, boolean sampel){
this.kelas2 = kelas2;
this.sampel = sampel;
}
public double n(){
int l = kelas2.length;
double sumFi=0;
for(int i = 0; i<l; ++i){
sumFi+=kelas2[i].frek;
}
return sumFi;
}
public double mean(){
int l = kelas2.length;
double sumFiXi = 0;
for(int i = 0; i<l; ++i){
sumFiXi+=kelas2[i].fiXi();
}
return sumFiXi/n();
}
public double q(int i) throws Exception{
if (i < 1 || i> 3){
throw new Exception("q i ccd");
}
return x(n()*i/4.0);
}
public double median() throws Exception{
return q(2);
}
public double x(double i)throws Exception{
if(i < 1 || i > n()){
throw new Exception("x i ccd");
}
Kelas k = null;
int l = kelas2.length;
double tfk = 0;
double fk = 0;
for(int j = 0; j <l; ++j){
Kelas kj = kelas2[j];
tfk += kj.frek;
if(tfk > i){
break;
}
fk += kj.frek;
k = kj;
}
if (tfk < i || k == null || fk > i){
throw new Exception("wtf i");
}
return k.tb() + ((i-fk)/k.frek)*k.panjang();
}
public double dModus(int j){
Kelas kj = kelas2[j];
double d1 = kj.frek;
double d2 = kj.frek;
if (j > 0) d1 -= kelas2[j-1].frek;
if (j < kelas2.length-1) d2 -= kelas2[j+1].frek;
return kj.tb() + (kj.panjang()*d1/(d1+d2));
}
public int[] kModus(){
double f=kelas2[0].frek;
int l = kelas2.length;
int c = 0;
for(int j=1; j < l; ++j){
double fj = kelas2[j].frek;
if (fj > f){
f = fj;
}
}
int[] tks = new int[kelas2.length];
for(int j=0; j < l; ++j){
Kelas kj = kelas2[j];
if(kj.frek == f){
tks[c++]=j;
}
}
int[] ret = new int[c];
for(int j = 0; j < l; ++j){
ret[j]=tks[j];
}
return ret;
}
public double[] modus(){
int[] tks = kModus();
int c = tks.length;
double[] ret = new double[c];
for(int j = 0; j < c; ++j){
ret[j] = dModus(tks[j]);
}
return ret;
}
public double range(){
return kelas2[kelas2.length-1].xi() - kelas2[0].xi();
}
public double sr(){
double mean = mean();
double sum = 0;
int l = kelas2.length;
for (int j = 0; j < l; ++j){
sum+=kelas2[j].deltaMeanXiFi(mean);
}
return sum/n();
}
public double v(){
double mean = mean();
double sum = 0;
int l = kelas2.length;
for(int j = 0; j < l; ++j){
sum += kelas2[j].sqDeltaMeanXiFi(mean);
}
if (sampel){
return sum/(n()-1);
}else{
return sum/n();
}
}
public double s(){
return Math.sqrt(v());
}
}
public static void main(String[] args) {
}
}