Java冒泡排序

直接上干货

public class bubbledSort {
    public static void main(String[] args) {
        int[] data = {14,31245,4125,26,3,13236,75,2135,7685,3167};

        System.out.println("排序之前：\t" + java.util.Arrays.toString(data));

        bubbled(data);

        System.out.println("排序之后：\t" + java.util.Arrays.toString(data));
    }

    public static void bubbled(int[] data){
        System.out.println("开始排序");
        int arrayLength = data.length;
        for (int i = 0; i < arrayLength - 1; i++) {	//外层循环数组长度 -1
            boolean flag = false;
            for (int j = 0; j < arrayLength - 1 - i; j++) { //内层循环 -1-i
                if(data[j] > data[j + 1]){
                    int temp = data[j + 1];
                    data[j + 1] = data[j];
                    data[j] = temp;
                    flag = true;
                }
            }
            System.out.println(java.util.Arrays.toString(data));
            if (!flag)
                break;
        }
    }
}