Question

Write a Java program with a single-dimension array that holds 11 integer numbers and sort the array using a bubble sort. Next, identify the median value of the 11 integers. Here are the steps your program must accomplish. algorithm (either flowchart or pseudocode) that you will use to write the program Step 1. Create an Place the algorithm in a Word document. 6. Ste the Step 2. Code the program in Eclipse and ensure the following steps are accomplished. 1. Generate 11 random integer numbers between 1 and 100, and place each random number in a different element of a single-dimension array starting with the first number generated 2. Display the array's contents in the order the numbers are initially Inserted. This is called an unsorted list. An example is below. Th The unsorted list is: 76 9e 86 66 32 78 30 74 375 3. Using the bubble sort, now sort the array from smallest integer to the largest. The bubble sort be in its own method; Use this code, and not some code you find online Bubble Sort Code: it cannot be in the main method. Here is the code for the bubble sort method public static void bubbleSoct(intL) list) int tempi for (int 1 t) temp 1ist[) 3 1) temp SLS 4. Display the array's contents after the bubble sort is completed. An example is below The sorted list is3 32 37 6e 66 74 76 76 9

Answer 1

public class Test{  

public static void main(String args[]){

int[] list = new int[11];

for(int i = 0; i < 11; i++)

list[i] = (int )(Math. random() * 100 + 1);

System.out.print("The unsorted list is: ");

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

System.out.print(list[i] + " ");

System.out.println("");

bubbleSort(list);

System.out.print("The sorted list is: ");

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

System.out.print(list[i] + " ");

System.out.println("");

double median;

int location;

location = list.length / 2;

median = list[location];

System.out.println("The median is located at position " + location + " and the value is " + median);

}

private static void bubbleSort(int[] list) {

int temp;

for(int i = list.length - 1; i > 0; i--) {

for(int j = 0; j < i; j++) {

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

temp = list[j];

list[j] = list[j + 1];

list[j + 1] = temp;

}

}

}

}

}

null

Please check the code. If you have any doubts comment below and I am happy to help :)