java冒泡排序

public static void main(String[] args) {    int array[] = {12, 3, 5, 675, 86, 34, 23, 5, 57, 76, 98, 3, 4, 7, 932, 1, 3, 7, 6, 34};    int temp;    for (int i = 0; i < array.length - 1; i++) {        for (int j = 0; j < array.length - 1 - i; j++) {            if (array[j] > array[j + 1]) {                temp = array[j];                array[j] = array[j + 1];                array[j + 1] = temp;            }        }    }    for (int j = 0; j < array.length; j++) {        System.out.println(array[j]);    }}