java 冒泡排序

package com.mulun.sorting;

import java.util.Arrays;

/**
 * <h1>冒泡排序</h1>
 *
 * @author mulun
 */
public class BubbleSorting {
    public static void main(String[] args) {

        // 模拟8万条数据
        int[] arr = new int[80000];

        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (Math.random() * 80000);
        }

        long start = 0L;
        long end = 0L;

        start = System.currentTimeMillis();
        bubble(arr);
        end = System.currentTimeMillis();

        System.out.printf("排序所花费的时间：%d", (end - start));
    }

    public static void test1() {
        int[] arr = {23, 12, 2, 45, 2, 46, 3, 74, 0};

        bubble(arr);

        System.out.println(Arrays.toString(arr));
    }

    public static void bubble(int[] arr) {
        int temp = 0;
        boolean flag = false;

        // 时间复杂度：O(n^2)
        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]) {
                    flag = true;
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
            // 说明在排序中，一次都没交换
            if (!flag) {
                break;
            } else {
                flag = false;
            }
        }
    }
}