(Java) Activity 4.4 DO PART 2! PART 2 IS BASED OFF PART 1!!! PART 1: Open up Eclipse and create a new Java project called Sort with a class named Sort.java. Copy and paste the starter code below into the file and add your name in the comment at the top. /** * Sort.java * A program to sort a list of numbers * @author */ public class Sort { public static void main(String[] args) { int top10Scores[] = {95, 92, 88, 99, 93, 89, 94, 97, 100, 91}; System.out.println("Top 10 Exam Scores, Unsorted:"); printArray(top10Scores); //call bubbleSort here! System.out.println("\nAfter Sorting:"); printArray(top10Scores); }//end of main /** * Sorts an array of integers from smallest to largest * using the bubble sort algorithm * @param array the list of integer values */ public static void bubbleSort(int array[]) { return; } /** * Print an array of integers to the console * @param array the list of integer values */ public static void printArray(int[] array) { for (int i = 0; i < array.length; i++) { System.out.println((i + 1) + ". " + array[i]); } } //end of method printArray }//end of class Write the bubbleSort method using the more efficient version of bubble sort's pseudocode provided above. Make sure your bubbleSort method correctly sorts the given array. If you get stuck, post a question on Piazza. When finished, upload your Sort.java file PART 2: Open up your Sort.java file from the prior activity. Copy and paste the below method into your file right below bubbleSort. /** * Sorts an array of integers from smallest to largest * using the insertion sort algorithm * @param array the list of integer values */ public static void insertionSort(int array[]) { return; } Write the insertionSort method by using the pseudocode for insertion sort provided above. Now, remove the method call to bubbleSort in main and replace it with a call to insertionSort. Note that you can leave the bubbleSort method inside of your program, you just won't be calling it. You should get the same sorted output as when you called bubbleSort. When finished, upload Sort.java

(Java) Activity 4.4 DO PART 2! PART 2 IS BASED OFF PART 1!!! PART 1: Open up Eclipse and create a new Java project called Sort with a class named Sort.java. Copy and paste the starter code below into the file and add your name in the comment at the top. /** * Sort.java * A program to sort a list of numbers * @author */ public class Sort { public static void main(String[] args) { int top10Scores[] = {95, 92, 88, 99, 93, 89, 94, 97, 100, 91}; System.out.println("Top 10 Exam Scores, Unsorted:"); printArray(top10Scores); //call bubbleSort here! System.out.println("\nAfter Sorting:"); printArray(top10Scores); }//end of main /** * Sorts an array of integers from smallest to largest * using the bubble sort algorithm * @param array the list of integer values */ public static void bubbleSort(int array[]) { return; } /** * Print an array of integers to the console * @param array the list of integer values */ public static void printArray(int[] array) { for (int i = 0; i < array.length; i++) { System.out.println((i + 1) + ". " + array[i]); } } //end of method printArray }//end of class Write the bubbleSort method using the more efficient version of bubble sort's pseudocode provided above. Make sure your bubbleSort method correctly sorts the given array. If you get stuck, post a question on Piazza. When finished, upload your Sort.java file PART 2: Open up your Sort.java file from the prior activity. Copy and paste the below method into your file right below bubbleSort. /** * Sorts an array of integers from smallest to largest * using the insertion sort algorithm * @param array the list of integer values */ public static void insertionSort(int array[]) { return; } Write the insertionSort method by using the pseudocode for insertion sort provided above. Now, remove the method call to bubbleSort in main and replace it with a call to insertionSort. Note that you can leave the bubbleSort method inside of your program, you just won't be calling it. You should get the same sorted output as when you called bubbleSort. When finished, upload Sort.java

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

100%

(Java)

Activity 4.4

DO PART 2! PART 2 IS BASED OFF PART 1!!!

PART 1:

Open up Eclipse and create a new Java project called Sort with a class named Sort.java.
Copy and paste the starter code below into the file and add your name in the comment at the top.

/**
* Sort.java
* A program to sort a list of numbers
* @author
*/

public class Sort {

public static void main(String[] args) {

int top10Scores[] = {95, 92, 88, 99, 93, 89, 94, 97, 100, 91};
System.out.println("Top 10 Exam Scores, Unsorted:");
printArray(top10Scores);

//call bubbleSort here!

System.out.println("\nAfter Sorting:");
printArray(top10Scores);

}//end of main

/**
* Sorts an array of integers from smallest to largest
* using the bubble sort algorithm
* @param array the list of integer values
*/
public static void bubbleSort(int array[]) {
return;
}

/**
* Print an array of integers to the console
* @param array the list of integer values
*/
public static void printArray(int[] array) {
for (int i = 0; i < array.length; i++) {
System.out.println((i + 1) + ". " + array[i]);
}
} //end of method printArray

}//end of class

Write the bubbleSort method using the more efficient version of bubble sort's pseudocode provided above.
Make sure your bubbleSort method correctly sorts the given array.
If you get stuck, post a question on Piazza.
When finished, upload your Sort.java file

PART 2:

Open up your Sort.java file from the prior activity.
Copy and paste the below method into your file right below bubbleSort.

   /**
* Sorts an array of integers from smallest to largest
   * using the insertion sort algorithm
* @param array the list of integer values
*/

public static void insertionSort(int array[]) {
       return;
   }

Write the insertionSort method by using the pseudocode for insertion sort provided above.
Now, remove the method call to bubbleSort in main and replace it with a call to insertionSort.
Note that you can leave the bubbleSort method inside of your program, you just won't be calling it.
You should get the same sorted output as when you called bubbleSort.
When finished, upload Sort.java

Expert Solution