Advertisement
Guest User

Untitled

a guest
Jun 16th, 2019
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.83 KB | None | 0 0
  1. import java.util.Scanner;
  2. public class Arreglos {
  3. public static int [ ] llenarArreglo ( int elementos ) {
  4. int i; int [ ] v;
  5. v = new int [ elementos ];
  6. Scanner sc = new Scanner ( System.in );
  7.  
  8. for ( i = 0; i < elementos; i++ ) {
  9. System.out.print ( "v [ " + i + " ] = " );
  10. v [ i ] = sc.nextInt ( );
  11. }
  12.  
  13. return v;
  14. }
  15.  
  16. public static double promedio ( int [ ] v ) {
  17. double prom = 0.0;
  18. for ( int i = 0; i < v.length; i++ )
  19. prom += v[i];
  20.  
  21. return prom / ( double ) v.length;
  22. }
  23.  
  24. public static double desviacion ( int [ ] v ) {
  25. double prom, sum = 0; int i, n = v.length;
  26. prom = promedio ( v );
  27.  
  28. for ( i = 0; i < n; i++ )
  29. sum += Math.pow ( v [ i ] - prom, 2 );
  30.  
  31. return Math.sqrt ( sum / ( double ) n );
  32. }
  33.  
  34.  
  35.  
  36. //0 - Menor a Mayor, 1 - Mayor a menor
  37. public static int [ ] burbuja ( int [ ] v, int ord ) {
  38. int i, j, n = v.length, aux = 0;
  39.  
  40. for ( i = 0; i < n - 1; i++ )
  41. for ( j = i + 1; j < n; j++ )
  42. if ( ord == 0 )
  43. if ( v [ i ] > v [ j ] ) {
  44. aux = v [ j ];
  45. v [ j ] = v [ i ];
  46. v [ i ] = aux;
  47. }
  48. else if ( ord == 1 )
  49. if ( v [ i ] < v [ j ] ) {
  50. aux = v [ i ];
  51. v [ i ] = v [ j ];
  52. v [ j ] = aux;
  53. }
  54.  
  55. return v;
  56. }
  57.  
  58. public static double mediana ( int [ ] v ) {
  59. int pos = 0, n = v.length;
  60. double temp = 0, temp0 = 0;
  61. // ordenar de menor a mayor
  62. v = burbuja ( v, 0 );
  63.  
  64. temp = n / 2;
  65. if ( n % 2 == 0 ) {
  66. pos = (int)temp;
  67. temp0 = (double)(v [ pos ] / v [ pos + 1 ]);
  68. }
  69. if ( n % 2 == 1 ) {
  70. pos = (int)(temp + 0.5);
  71. temp0 = (double)(v [ pos ]);
  72. }
  73.  
  74. return temp0;
  75. }
  76.  
  77. public static int rango ( int [ ] v ) {
  78. // ordenar de mayor a menor
  79. v = burbuja ( v, 1 );
  80.  
  81. return v [ v.length - 1 ] - v [ 0 ];
  82. }
  83.  
  84. public static int moda ( int [ ] v ) {
  85. int i, j, moda = 0, n = v.length, frec;
  86. int frecTemp, frecModa = 0, moda1 = -1;
  87.  
  88. // ordenar de menor a mayor
  89. v = burbuja ( v, 0 );
  90.  
  91. for ( i = 0; i < n; i++ ) {
  92. frecTemp = 1;
  93. for ( j = i + 1; j < n; j++ ) {
  94. if ( v [ i ] == v [ j ] )
  95. frecTemp++;
  96. }
  97. if ( frecTemp > frecModa ) {
  98. frecModa = frecTemp;
  99. moda1 = v [ i ];
  100. }
  101. }
  102. return moda1;
  103. }
  104.  
  105. public static void reportaVector ( int [ ] v ) {
  106. for ( int i = 0; i < v.length; i++ )
  107. System.out.print ( v [ i ] + " " );
  108. System.out.println ( "" );
  109. }
  110.  
  111.  
  112. public static void main ( String [ ] args ) {
  113. int n; int [] v;
  114. double media, mediana, moda, rango, desviacion;
  115. Scanner sc = new Scanner ( System.in );
  116. System.out.println ( "Dimension Arreglo : ");
  117. n = sc.nextInt ( );
  118.  
  119. v = llenarArreglo ( n );
  120.  
  121. //Media
  122. media = promedio ( v );
  123. //Mediana
  124. mediana = mediana ( v );
  125.  
  126. //Moda
  127. moda = moda ( v );
  128.  
  129. //Rango
  130. rango = rango ( v );
  131.  
  132. //Desviacion
  133. desviacion = desviacion ( v );
  134.  
  135. System.out.println ( " Moda del vector: " + moda);
  136. System.out.println ( " Media del vector: " + media);
  137. System.out.println ( " Mediana del vector: " + mediana);
  138. System.out.println ( " Rango del vector: " + rango);
  139. System.out.println ( " Desviacion del vector: " + desviacion);
  140.  
  141. reportaVector ( v );
  142. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement