java冒泡排序(冒泡)算法Bubblesort

public class Test {    public static void main(String[] args) {        int[] a = {5, 2, 6, 9, 1, 3, 7, 4, 0, 8};        printIntArray(a);        bubble(a);        printIntArray(a);    }    public static void bubble(int[] a) {        int tmp;        for (int i = 0; i < a.length - 1; i++) {            for (int j = 0; j < a.length - 1 - i; j++) { //上面的每循环一次，最大值移到最后，所以只比较前长度-i的值                if (a[j] > a[j + 1]) { //控制从小到大，前小后大                    tmp = a[j];                    a[j] = a[j + 1];                    a[j + 1] = tmp;                }            }        }    }    public static void printIntArray(int[] a) {        for (int i : a) {            System.out.print(i + " ");        }        System.out.println("");    }}