冒泡排序

图解：

代码分析：

package com.paixu;

public class maopaopaixu {
    public static void main(String[] args) {
        int [] arr = {25,24,99,101,100,552,32,333,5555,99999,686,4598,32,3657,12,11,22,88};
        System.out.println("排序前:");
        iterator(arr);
        System.out.println("-----------------------");
        /*
        //第一次排序
        for(int i = 0;i<arr.length-1;i++){
            if(arr[i]>arr[i+1]){
                int temp = arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第一次排序：");
        iterator(arr);
        System.out.println("-----------------------");
        //第二次排序
        for(int i = 0;i<arr.length-1-1;i++){
            if(arr[i]>arr[i+1]){
                int temp = arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第二次排序：");
        iterator(arr);
        System.out.println("-----------------------");
        //第三次排序
        for(int i = 0;i<arr.length-1-1-1;i++){
            if(arr[i]>arr[i+1]){
                int temp = arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = temp;
            }
        }
        System.out.println("第三次排序：");
        iterator(arr);
        */
        maopaopaixu(arr);
    }
    //冒泡排序
    public static void maopaopaixu(int[] arr){
        for(int j = 1;j<arr.length-1;j++){
            for(int i = 0;i<arr.length-j;i++){
                if(arr[i]>arr[i+1]){
                    int temp = arr[i];
                    arr[i] = arr[i+1];
                    arr[i+1] = temp;
                }
            }
        }
        System.out.println("排序后：");
        iterator(arr);
    }
    //遍历数组
    public static void iterator(int[] arr){
        System.out.print("[");
        for(int x = 0;x<arr.length;x++){
            if(x == arr.length-1){
                System.out.println(arr[x]+"]");
            }else{
                System.out.print(arr[x]+"，");
            }
        }
    }
}