冒泡排序

package sort;

import java.util.Arrays;

public class BubblleSort {
    public static void main(String[] args) {
        int[] arr = {3, 45, 6, 8, 9, 2};
        BubblleSort.sort(arr);
    }

    /**
     * [3, 45, 6, 8, 9, 2]
     * [3, 45, 6, 8, 9, 2]
     * [3, 6, 45, 8, 9, 2]
     * [3, 6, 8, 45, 9, 2]
     * [3, 6, 8, 9, 45, 2]
     * [3, 6, 8, 9, 2, 45]
     * [3, 6, 8, 9, 2, 45]
     * [3, 6, 8, 9, 2, 45]
     * [3, 6, 8, 9, 2, 45]
     * [3, 6, 8, 2, 9, 45]
     * [3, 6, 8, 2, 9, 45]
     * [3, 6, 8, 2, 9, 45]
     * [3, 6, 2, 8, 9, 45]
     * [3, 6, 2, 8, 9, 45]
     * [3, 2, 6, 8, 9, 45]
     * [2, 3, 6, 8, 9, 45]
     * O(n^2)
     */
    public static void sort(int[] arr) {
        //比较的次数
        for (int i = 1; i < arr.length; i++) {
            //比较，小的往前走
            for (int j = 0; j < arr.length - i; j++) {
                System.out.println(Arrays.toString(arr));
                //小的往前走
                if (arr[j] > arr[j + 1]) {
                    swap(arr, j, j + 1);
                }
            }

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

    }

    private static void swap(int[] arr, int a, int b) {
        int tmp = arr[a];
        arr[a] = arr[b];
        arr[b] = tmp;

    }

}