排序算法：冒泡排序

 // 冒泡 排序
        int[] b = new int[]{4,5,6,1,3,2};

        for (int i = 0;i < b.length; i++){
            for (int j = 0; j< b.length - i - 1; j++){
                if (b[j]>b[j+1]){
                    int temp = b[j];
                    b[j] = b[j+1];
                    b[j+1] = temp;
                }
            }
        }