冒泡算法从大到小的排序或从小到大排序 一秒即懂

//冒泡算法从大到小
public class Test {
    public static void main(String[] args) {

        int array[] ={-5,-2,5,10,895};
        for (int i = 0; i < array.length + 1; i++) {
            for (int j = i+1; j < array.length; j++) {
            if (array[i]  array[i + 1]) {
                int temp = array[i];
                array[i] = array[i + 1];
                array[i + 1] = temp;

            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(" " + array[i] + "");
        }
    }
}