Scribd
Upload
13 views3 pages

Moediana Desv Java6

This Java program defines methods to analyze arrays, including filling an array with user input, calculating the average, sorting arrays in ascending or descending order using bubble sort, and finding the median, mode, range, and standard deviation. It demonstrates calling these methods in the main function to analyze a user-input array and output the results.

Uploaded by

Ana López
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
13 views3 pages

Moediana Desv Java6

This Java program defines methods to analyze arrays, including filling an array with user input, calculating the average, sorting arrays in ascending or descending order using bubble sort, and finding the median, mode, range, and standard deviation. It demonstrates calling these methods in the main function to analyze a user-input array and output the results.

Uploaded by

Ana López
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

import java.util.

Scanner;
public class Arreiglos {
public static int [ ] llenarArreglo ( int elementos ) {
int i; int [ ] v;
v = new int [ elementos ];
Scanner sc = new Scanner ( System.in );

for ( i = 0; i < elementos; i++ ) {


System.out.print ( "v [ " + i + " ] = " );
v [ i ] = sc.nextInt ( );
}

return v;
}

public static double promedio ( int [ ] v ) {


double prom = 0.0;
for ( int i = 0; i < v.length; i++ )
prom += v[i];

return prom / ( double ) v.length;


}

public static double desviacion ( int [ ] v ) {


double prom, sum = 0; int i, n = v.length;
prom = promedio ( v );

for ( i = 0; i < n; i++ )


sum += Math.pow ( v [ i ] - prom, 2 );

return Math.sqrt ( sum / ( double ) n );


}

// 0 - Menor a Mayor, 1 - Mayor a menor


public static int [ ] burbuja ( int [ ] v, int ord ) {
int i, j, n = v.length, aux = 0;

for ( i = 0; i < n - 1; i++ )


for ( j = i + 1; j < n; j++ )
if ( ord == 0 )
if ( v [ i ] > v [ j ] ) {
aux = v [ j ];
v [ j ] = v [ i ];
v [ i ] = aux;
}
else if ( ord == 1 )
if ( v [ i ] < v [ j ] ) {
aux = v [ i ];
v [ i ] = v [ j ];
v [ j ] = aux;
}

return v;
}

public static double mediana ( int [ ] v ) {


int pos = 0, n = v.length;
double temp = 0, temp0 = 0;
// ordenar de menor a mayor
v = burbuja ( v, 0 );

temp = n / 2;
if ( n % 2 == 0 ) {
pos = (int)temp;
temp0 = (double)(v [ pos ] / v [ pos + 1 ]);
}
if ( n % 2 == 1 ) {
pos = (int)(temp + 0.5);
temp0 = (double)(v [ pos ]);
}

return temp0;
}
public static int rango ( int [ ] v ) {
// ordenar de mayor a menor
v = burbuja ( v, 1 );

return v [ v.length - 1 ] - v [ 0 ];
}

public static int moda ( int [ ] v ) {


int i, j, moda = 0, n = v.length, frec;
int frecTemp, frecModa = 0, moda1 = -1;

// ordenar de menor a mayor


v = burbuja ( v, 0 );

for ( i = 0; i < n; i++ ) {


frecTemp = 1;
for ( j = i + 1; j < n; j++ ) {
if ( v [ i ] == v [ j ] )
frecTemp++;
}
if ( frecTemp > frecModa ) {
frecModa = frecTemp;
moda1 = v [ i ];
}
}
return moda1;
}

public static void reportaVector ( int [ ] v ) {


for ( int i = 0; i < v.length; i++ )
System.out.print ( v [ i ] + " " );
System.out.println ( "" );
}

public static void main ( String [ ] args ) {


int n; int [] v;
double media, mediana, moda, rango, desviacion;
Scanner sc = new Scanner ( System.in );
System.out.println ( "Dimension Arreglo : ");
n = sc.nextInt ( );

v = llenarArreglo ( n );

//Media
media = promedio ( v );
//Mediana
mediana = mediana ( v );

//Moda
moda = moda ( v );

//Rango
rango = rango ( v );

//Desviacion
desviacion = desviacion ( v );

System.out.println ( " Moda del vector: " + moda);


System.out.println ( " Media del vector: " + media);
System.out.println ( " Mediana del vector: " + mediana);
System.out.println ( " Rango del vector: " + rango);
System.out.println ( " Desviacion del vector: " +
desviacion);

reportaVector ( v );
}
}

You might also like