冒泡排序

//经典冒泡排序public static void main (String[] args){    int[] ary = { 35, 12, 19, 9, 37, 58, 48, 89 };    //取ary数组中的每一个元素    for(int i = 0;i<ary.length-1;i++){        for(int j = 0;j<ary.length-i-1;j++){            // 如果j>j+1的数,那么进行替换            if(ary[j] > ary[j + 1]){                int k = ary[j];                ary[j] = ary[j + 1];                ary[j + 1] = k;            }        }    }    System.out.println(Arrays.toString(ary));}