经典算法之冒泡排序（Bubble Sort）

输入: arrs= [5,0,9,3,-1,12]
输出: arrs= [-1,0,3,5,9,12]

输入: arrs= [3,5,9,7,2,1]
输出: arrs= [1,2,3,5,7,9]

public class BubbleTest {
    public static void main(String[] args) {
        Integer[] arr = {3,5,9,7,2,1};
        Bubble.sort(arr);
        System.out.println(Arrays.toString(arr));
    }
    //数组排序
    public static void bubblesort(Comparable[] a){
        for (int i = a.length - 1;i > 0;i--){
            for (int j = 0;j < i;j++){
                if (greater(a[j],a[j + 1])){
                    swap(a,j,j + 1);
                }
            }
        }
    }
    //比较 v 是否大于 w
    public static boolean greater(Comparable v,Comparable w){
        return v.compareTo(w) > 0;
    }
    //数组元素交换位置
    private static void swap(Comparable[] a,int i,int j){
        Comparable temp;
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
}