冒泡排序

冒泡排序

public static int[] test(int[] array){
    for(int i =0;i<array.length;i++){
        for(int j=0;j<array.length-1-i;j++){
            if(array[j]<array[j+1]){
                int a = array[j];
                int b = array[j+1];
                array[j] = b;
                array[j+1] = a;
            }
        }
    }
    return array;
}

希望在码农的山坡上越攀越高，欢迎各位大佬看官的指正及补充