冒泡排序

• 简介
• 代码

public class maopao {
    // test
    public static void main(String[] args) {
        int[] data = new int[100];
        Random random = new Random();
        for (int i = 0; i < 100; i++) {
            data[i] = random.nextInt();
            System.out.println(data[i]);
        }
        System.out.println("=====================================");
        int[] ret = demo(data);
        for (int value : ret) {
            System.out.println(value);
        }
    }
    public static int[] demo(int[] data) {
        int temp;
        // 外层控制次数
        for (int i = 0, length = data.length; i < length; i++) {
            // 内层控制每次遍历的个数(每过一次外层都会减少一次遍历的个数，而最后一个不用遍历)
            for (int j = 0; j < length - i - 1; j++) {
                if (data[j + 1] < data[j]) {
                    temp = data[j];
                    data[j] = data[j + 1];
                    data[j + 1] = temp;
                }
            }
        }
        return data;
    }
}