冒泡排序算法

冒泡排序static  int[]a=new int[]{32,2,2424,21,46,46446,34,21};static void maoPao(int[]b){    for (int i = 0; i < b.length-1; i++) {        for (int j = 0; j < b.length-1-i; j++) {            if (b[j+1]<b[j]){                int tem=b[j+1];                b[j+1]=b[j];                b[j]=tem;            }        }    }    for (int i:b){        System.out.print(i+"\t");    }}

来源：https://www.cnblogs.com/miaopasi-lianjiang/p/11390516.html