冒泡算法

public class Test2 {    int[] cors = {85,26,45,48,21,95,98,84,77,79};    int temp = 0;    public static void main(String[] args) {        new Test2().sort();        System.out.println("hello word");    }    public void sort(){        for (int i = 0; i < cors.length-1; i++) {            for(int j= 0 ;j<cors.length-i-1;j++){                if (cors[j]<cors[j+1]) {                    temp = cors[j];                    cors[j] = cors[j+1];                    cors[j+1]=temp;                }            }        }        for (int i = 0; i < cors.length; i++) {            System.out.print(cors[i]+" ");        }    }}