(JAVA CODE)Please provide a 1d array of size 10 filled with random integers between 0 and 100. Please then sort this array using the selection sorting algorithm.
Algorithm for selection sorting
2 4 5 1 3
1 4 5 2 3
1 2 5 4 3
1 2 3 4 5
Pseudocode:
Starting with the initial position (i=0)
Find the smallest item in the array
Swap the smallest item with the item in the index i
Update the value of i by i+1
public static int [ ] selectionSort ( int [ ] array) {
int temp; //swapping operation
int min_idx;
for (int i=0; i < array.length; i++) {
min_idx = i; // min_idx = 0;
for (int j = i+1; j< array.length; j++) {
if (array[min_idx] > array[ j ] ) // 3 > 2? 2 >1?
min_idx = j;
}
temp = array[ i ];
array [ i ] = array [ min_idx ];
array [min_idx] = temp;
}
return array;
}
(JAVA CODE)TASK-2: Please write two functions that will calculate the mean and median values within a given 1d array. Thus, your functions should take the 1d arrays and calculate the average value as well as the median values. You should also check your findings using the functions in the Math library.
Array = 2 1 3 4 10
Mean: (2+1+3+4+10)/5 = 4
Median: 1 2 3 4 10
= 3
Median: 1 2 3 4 10 12
= 3.5
public static double meanOfArray (int [] myArray) {
int sum = 0;
for (int i = 0, i < myArray.length; i++)
sum = sum + myArray[ i ];
return sum/myArray.length; // check whether it is a double value.
}
public static double medianOfArray (int [] myArray) {
myArray = selectionSort(myArray[]);
if (myArray.length % 2 ==1)
return myArray[ int(myArray.length/2) ];
else
return (myArray[myArray.length/2] + myArray[ (myArray.length/2) -1 ]) /2;
}