史上最完整的冒泡排序

public static <T extends Comparable<T>> void bubbleSort(T[] array){
  boolean swapped = true;
  for(int i = 1; swapped && i < array.length; i++){
    swapped = false;
    for(int j = 0; i < array.length - 1; i++){
      if(array[j].compareTo(array[j+1]) > 0){
        T temp = array[j];
        array[j] = array[j+1];
        array[j+1] = temp;
        swapped = true;
      }
    }
  }
}

public static <T> void bubbleSort(T[] array, Comparator<T> comp){
  boolean swapped = true;
  for(int i = 1; swapped && i < array.length; i++){
    swapped = false;
    for(int j = 0; i < array.length - 1; i++){
      if(comp.compare(array[j], array[j+1]) > 0){
        T temp = array[j];
        array[j] = array[j+1];
        array[j+1] = temp;
        swapped = true;
      }
    }
  }
}