编程基础之冒泡排序法

public class maopao{

public static void main(String [] args){

int [] paopao=new int []{32,2,113,23,9,1,22};

for (int a=0;a<paopao.length-1 ;a++ ){

for (int b=0;b<paopao.length-1-a;b++){

int z;

if (paopao[b]>paopao[b+1]){

z=paopao[b];

paopao[b]=paopao[b+1];

paopao[b+1]=z;

}

}

}

for (int i=0;i<paopao.length ;i++ ){

System.out.print(paopao[i]+"  ");

}

}

}