java 冒泡排序法

/**
 * @author: zsg
 * @description: 冒泡
 * @date: 2018/6/8 10:37
 * @modified:
 */
public class demo1 {
    public static void main(String[] args) {
        int[] arr = {2,4,1,2,3,5,4};
        for (int i = 0; i <arr.length -1; i++) {
            for (int j = 0; j <arr.length-i-1 ; j++) {
                if (arr[j]>arr[j+1]){
                    int a=arr[j];
                    arr[j] =arr[j+1];
                    arr[j+1]=a;
                }
            }
        }
        for (int i = 0; i <arr.length ; i++) {
            System.out.println(arr[i]);
        }

    }
}

加入群聊  602640939