冒泡排序实现

public static void bubbleSort(Comparable[] c) {
             for (int i = 0; i < c. length; i++) {
                  Comparable tmp = null ;
                   boolean isExchanged = false;
                   for (int j = c. length - 1; j > i; j--) {
                         if (c[j].compareTo(c[j - 1]) < 0) {
                              tmp = c[j];
                              c[j] = c[j - 1];
                              c[j - 1] = tmp;
                              isExchanged = true ;
                        }
                  }
                  
                  //如果本次已未进行交换，则表示排序已经完成，提前终止循环
                  if (!isExchanged) {
                         return ;
                  }
            }
      }