Solve this error 8023- Ed Lessons V Next ds ng Description Feedback TESTCASES testExampleData X Failed:

Solve this error

 

Transcribed Image Text:

8023- Ed Lessons V Next ds ng Description ✓ Feedback TESTCASES testExampleData X Failed: At least one swap was incorrect. ==> expected: <[12, 23, 66, 45, 87, 19] [12, 19, 66, 45, 87, 23] [12, 19, 23, 45, 87, 66] [12, 19, 23, 45, 66, 87]> but was: <After swap, array is [23, 45, 66, 12, 87, 19] After swap, array is [12, 45, 66, 23, 87, 19] After swap, array is [12, 23, 66, 45, 87, 19] After swap, array is [12, 19, 66, 45, 87, 23] After swap, array is [12, 19, 45, 66, 87, 23] After swap, array is Unbounded Selection Sort (Extension Exercise) + SelectionSort.java 1 import java.util.Arrays; 2 //Importing packages 3 public class SelectionSort{ 4 private static void printArray (int[] a) { //Function to print array 5 m.out.println (Arrays.toString(a)); [12, 19, 23, 66, 87,45] After swap, array is [12.19. 23. 45. 87.661 2/5 passed 6 Sys 7 //Dispalys result to user 8} 9 10 public static int[] selectionSort (int[] data) { 11 //Function that performs sorting operation 12 for (int i=0; i<data.length; i++) { 13 for (int j =i+1; j<data.length; j++) { 14 if(data[i]>data[j]) { 15 //Checking for order 16 int temp = data[i]; 17 data[i] = data[j]; /home/SelectionSort java Spaces: 4 (Auto) Console Terminal After swap, array is [33, 45, 93, 55] After swap, array is [33, 45, 55, 93] After sorting the array is: [33, 45, 55, 93] Challenge Program exited with code 0 20°C Cloudy@ 8023- Ed Lessons V Next ds ng Description ✓ Feedback TESTCASES testExampleData X Failed: At least one swap was incorrect. ==> expected: <[12, 23, 66, 45, 87, 19] [12, 19, 66, 45, 87, 23] [12, 19, 23, 45, 87, 66] [12, 19, 23, 45, 66, 87]> but was: <After swap, array is [23, 45, 66, 12, 87, 19] After swap, array is [12, 45, 66, 23, 87, 19] After swap, array is [12, 23, 66, 45, 87, 19] After swap, array is [12, 19, 66, 45, 87, 23] After swap, array is [12, 19, 45, 66, 87, 23] After swap, array is Unbounded Selection Sort (Extension Exercise) + SelectionSort.java 1 import java.util.Arrays; 2 //Importing packages 3 public class SelectionSort{ 4 private static void printArray (int[] a) { //Function to print array 5 m.out.println (Arrays.toString(a)); [12, 19, 23, 66, 87,45] After swap, array is [12.19. 23. 45. 87.661 2/5 passed 6 Sys 7 //Dispalys result to user 8} 9 10 public static int[] selectionSort (int[] data) { 11 //Function that performs sorting operation 12 for (int i=0; i<data.length; i++) { 13 for (int j =i+1; j<data.length; j++) { 14 if(data[i]>data[j]) { 15 //Checking for order 16 int temp = data[i]; 17 data[i] = data[j]; /home/SelectionSort java Spaces: 4 (Auto) Console Terminal After swap, array is [33, 45, 93, 55] After swap, array is [33, 45, 55, 93] After sorting the array is: [33, 45, 55, 93] Challenge Program exited with code 0 20°C Cloudy@

Answer rating: 100% (QA)

It seems like youve posted a code snippet for a Java program implementing the selection sort algorit... View the full answer