Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

JAVA Help Please!! public class Sorting { public static void main(String[] args)

ID: 3915459 • Letter: J

Question

JAVA Help Please!!

public class Sorting {
    public static void main(String[] args) {
        // Example input.
        int numbers[] = {10, 2, 78, 4, 45, 32, 7, 11};
        int i;

        int numbersSize = numbers.length;
      
        // Print array pre sorting.
        System.out.print("UNSORTED: ");
        for (i = 0; i < numbersSize; i++) {
            System.out.print(numbers[i] + " ");
        }
        System.out.println();

        // Run Insertion Sort.
        insertionSort(numbers);

        // Print array post sorting.
        System.out.print("SORTED: ");
        for (i = 0; i < numbersSize; i++) {
            System.out.print(numbers[i] + " ");
        }
        System.out.println();
    }

    public static void insertionSort(int numbers[]) {
     
       for (int i = 1; i < numbers.length ; i ++ ) {        
            int j = i;
          
       while(j > 0){

       if (numbers[j] < numbers[j-1]) {
            int temp = numbers[j];
            numbers[j]= numbers[j-1];
            numbers[j-1] = temp;
            j--;
            }
           
       else{
            break;
            }

}
}
}
}

Q. How should I edit this so that

"Tests the array being a null value, should immediately return out of method."

???

Explanation / Answer

public class Sorting {

    public static void main(String[] args) {

        // Example input.

        int numbers[] = null;

        int i;

        if(numbers == null){

            System.out.println("Arrray is null, Program terminated");

    }

        else{

        // Print array pre sorting.

        System.out.print("UNSORTED: ");

        for (i = 0; i < numbers.length; i++) {

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

        }

        System.out.println();

        // Run Insertion Sort.

        insertionSort(numbers);

        // Print array post sorting.

        System.out.print("SORTED: ");

        for (i = 0; i < numbers.length; i++) {

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

        }

        System.out.println();

        }

    }

    public static void insertionSort(int numbers[]) {

   

       for (int i = 1; i < numbers.length ; i ++ ) {       

            int j = i;

         

       while(j > 0){

       if (numbers[j] < numbers[j-1]) {

            int temp = numbers[j];

            numbers[j]= numbers[j-1];

            numbers[j-1] = temp;

            j--;

            }

          

       else{

            break;

            }

}

}

}

}

Underlined the added code