Вопрос по правильному решению

// perform the bubble sort
static void bubbleSort(int array[]) {
  int size = array.length;

  // loop to access each array element
  for (int i = 0; i < (size-1); i++) {

    // check if swapping occurs
    boolean swapped = false;

    // loop to compare adjacent elements
    for (int j = 0; j < (size-i-1); j++) {

      // compare two array elements
      // change > to < to sort in descending order
      if (array[j] > array[j + 1]) {

        // swapping occurs if elements
        // are not in the intended order
        int temp = array[j];
        array[j] = array[j + 1];
        array[j + 1] = temp;

        swapped = true;
      }
    }
    // no swapping means the array is already sorted
    // so no need for further comparison
    if (!swapped)
      break;
  }
}

if (array[i] > array[j]) {

public static void sort(int[] a) {
    for (int i = 0; i < a.length - 1; i++) {
        boolean isSorted = true;
        for (int j = i + 1; j < a.length; j++) {
            if (a[i] > a[j]) {
                int temp = a[j];
                a[j] = a[i];
                a[i] = temp;
                isSorted = false;
            }
        }
        if (isSorted) break;
    }
}

int[] mas = {-5, 4, 4 ,4, 1};