kali ini saya akan menerangkan tentang program java mengenai statistika.
langsung aja ke programnya cekidot . . . . . . .
import java.util.* ;
public class minstat {
static double deret[] = {23,45,52,11,23,11};
public static void main(String[] args) {
double rata = ratarata();
double stdev = stdeviasi();
double varian = variasi();
double tempmin = cekmin();
double tempmax = cekmax();
double maxvalue = modus();
int meds = median();
System.out.println("rata2:"+rata);
System.out.println("standart deviasi:"+stdev);
System.out.println("variasi : "+ varian);
System.out.println("min : "+tempmin);
System.out.println("max : "+tempmax);
System.out.println("modusnya : "+maxvalue);
System.out.println("mediannya : "+deret[meds]);
}
private static double stdeviasi() {
double tempsum = 0;
double rata2 = ratarata();
int pembagi = deret.length;
for(int i=0; i<deret.length; i++){
double delta, kuaddelta;
delta = deret[i]-rata2;
kuaddelta = Math.pow(delta, 2);
tempsum = tempsum + kuaddelta;
}
double stedev = Math.sqrt(tempsum/(pembagi-1));
return stedev;
}
private static double ratarata() {
double tempsum=0, rata=0;
for(int i=0; i<deret.length; i++){
tempsum = tempsum+deret[i];
}
rata=tempsum/deret.length;
return rata;
}
private static double variasi(){
double tempsum = 0,varian, rata2 = ratarata();
for(int i=0; i<deret.length; i++){
double delta, kuaddelta;
delta = deret[i]-rata2;
kuaddelta = Math.pow(delta, 2);
tempsum = tempsum + kuaddelta;
}
varian = tempsum/(deret.length-1);
return varian;
}
private static double cekmin() {
double tempmin = 99999;
for(int i=0; i<deret.length; i++){
if (tempmin>deret[i])
tempmin = deret[i];
}
return tempmin;
}
private static double cekmax() {
double tempmax = 0;
for(int i=0; i<deret.length; i++){
if (tempmax<deret[i])
tempmax = deret[i];
}
return tempmax;
}
private static double modus (){
double maxvalue = 0, maxcount = 0;
for(int i = 0;i<deret.length;i++){
double count = 0;
for(int j = 0;j<deret.length;j++){
if (deret[i] == deret [j]){count++;}}
if (count>maxcount){
maxcount = count;
maxvalue = deret[i];}
}
return maxvalue;
}
private static int median(){
Arrays.sort(deret);
int meds;
if (deret.length%2 == 0){
meds = (deret.length/2)-1;
}
else {meds = deret.length/2;
}
return meds;
}
}
nih hasil compile nya . .
langsung aja ke programnya cekidot . . . . . . .
import java.util.* ;
public class minstat {
static double deret[] = {23,45,52,11,23,11};
public static void main(String[] args) {
double rata = ratarata();
double stdev = stdeviasi();
double varian = variasi();
double tempmin = cekmin();
double tempmax = cekmax();
double maxvalue = modus();
int meds = median();
System.out.println("rata2:"+rata);
System.out.println("standart deviasi:"+stdev);
System.out.println("variasi : "+ varian);
System.out.println("min : "+tempmin);
System.out.println("max : "+tempmax);
System.out.println("modusnya : "+maxvalue);
System.out.println("mediannya : "+deret[meds]);
}
private static double stdeviasi() {
double tempsum = 0;
double rata2 = ratarata();
int pembagi = deret.length;
for(int i=0; i<deret.length; i++){
double delta, kuaddelta;
delta = deret[i]-rata2;
kuaddelta = Math.pow(delta, 2);
tempsum = tempsum + kuaddelta;
}
double stedev = Math.sqrt(tempsum/(pembagi-1));
return stedev;
}
private static double ratarata() {
double tempsum=0, rata=0;
for(int i=0; i<deret.length; i++){
tempsum = tempsum+deret[i];
}
rata=tempsum/deret.length;
return rata;
}
private static double variasi(){
double tempsum = 0,varian, rata2 = ratarata();
for(int i=0; i<deret.length; i++){
double delta, kuaddelta;
delta = deret[i]-rata2;
kuaddelta = Math.pow(delta, 2);
tempsum = tempsum + kuaddelta;
}
varian = tempsum/(deret.length-1);
return varian;
}
private static double cekmin() {
double tempmin = 99999;
for(int i=0; i<deret.length; i++){
if (tempmin>deret[i])
tempmin = deret[i];
}
return tempmin;
}
private static double cekmax() {
double tempmax = 0;
for(int i=0; i<deret.length; i++){
if (tempmax<deret[i])
tempmax = deret[i];
}
return tempmax;
}
private static double modus (){
double maxvalue = 0, maxcount = 0;
for(int i = 0;i<deret.length;i++){
double count = 0;
for(int j = 0;j<deret.length;j++){
if (deret[i] == deret [j]){count++;}}
if (count>maxcount){
maxcount = count;
maxvalue = deret[i];}
}
return maxvalue;
}
private static int median(){
Arrays.sort(deret);
int meds;
if (deret.length%2 == 0){
meds = (deret.length/2)-1;
}
else {meds = deret.length/2;
}
return meds;
}
}
nih hasil compile nya . .