数据结构之冒泡排序（通过api设计实现的）

import java.util.Arrays;

public class Bubble {
    //构造方法 Bubble()：创建Bubble对象
    // 成员方法
    //public static void sort(Comparable[] a)：对数组内的元素进行排序
    //private static boolean greater(Comparable v,Comparable w):判断v是否大于w
    //private static void exch(Comparable[] a,int i,int j)：交换a数组中，索引i和索引j处的值
    //public int compareTo(Integer  anotherInteger)在数字上比较两个Integer对象  >返回1 =返回0 <返回-1

    public static void bubbleSort(Comparable[] a){
        for (int i = 1; i <a.length; i++) {
            for (int j = 1; j <=a.length-i; j++) {
                      if (greater(a[j-1],a[j])){
                          exch(a,j-1,j);
                }
            }
        }
    }
    private static boolean greater(Comparable v,Comparable w){
          return  v.compareTo(w)>0;
    }
    private static void exch(Comparable[] a,int i,int j){
             Comparable temp;
             temp =a[i];
             a[i]=a[j];
             a[j]=temp;
    }

    public static void main(String[] args) {
        Integer []a={1,3,5,2,4,6,7,0,-1,-1,-2};
        bubbleSort(a);
        System.out.println(Arrays.toString(a));

    }

}