Reference no: EM132430691

Java programming

1. Declare an array of double type, with size 10.
2. Use a regular for loop to generate 10 random double type variables and fill them into the array. The range of the random variables is between 0 and 100, including 0 and excluding 100. Use method Math.random().
3. Invoke a method named printArray in the same class, to print all elements of this array in one line, with a space separating adjacent array elements, and then output an end-of-line symbol at the end. You should use "printf" method to specify the output to have only 2 digits after the decimal point for each double type variable. This method "printArray "takes only one parameter, which is a double type one-dimensional array, and the method return type should be void. Use a for-each loop in this method to navigate through the array.
4. Invoke a method name sort in the same class, to sort this array in decreasing order. This method takes only one parameter, which is a double "type" array" and its return type should be void. You must choose one of these three algorithms: selection, insertion, or bubble sort. The source code of these three algorithms locates in zip file "search-and-sorting.zip". You need to modify the source code of the sorting algorithm you choose, and make it usable in this homework.

Note: you cannot invoke any existing sorting method from any Java library class, such as the sort method in java class Arrays. The purpose of this homework is to let you modify the sorting algorithm source code thus get a better understanding of how a sorting algorithm works internally. But if you just call a sort method in the Java jdk library, you lost the whole purpose of this homework, and you will receive zero point.

1. Invoke method printArray again to print the array to the screen, to verify that it has been sorted.

public class NameHw6 {

public static void main(String[] args)

{

final int SIZE = 10;

double [] scores = new double [SIZE];

for(int i = 0; i < scores.length; i++)

{

scores[i] = (double) (Math.random() * 100);

}

System.out.println("Before Sort: ");

printArray(scores);

sort(scores);

System.out.println("nAfter Sort: ");

printArray(scores);

}

private static void sort(double[] values) {

  int i, j;

  double temp;

  int numValues=values.length;

  // outer loop to travel through the all elements

  for (i = 0; i < numValues - 1; i++) {

     // inner loop to compare the outer loop elements

     for (j = 0; j < numValues - i - 1; j++)

        // if element at j< than j+1 than swap both

        if (values[j] > values[j + 1]) {

           // swap logic

           temp = values[j];

           values[j] = values[j+1];

           values[j+1] = temp;

        }

  }  

}

private static void printArray(double[] scores) {

  for (double eachElement: scores)

{

System.out.printf("%4.1f ", eachElement);

}  

}

}