冒泡排序
public class maopao {
public static void main(String[] args) {
int []maopao = new int[]{7,4,7,9,6,5,2,1,0,9};
for (int i = 0 ; i< maopao.length;i++){
for(int j = 0;j< maopao.length-1-i;j++){
if(maopao[j]>maopao[j+1]){
int temp = maopao[j];
maopao[j]=maopao[j+1];
maopao[j+1]=temp;
}
}
}
for(int i = 0;i<maopao.length;i++){
System.out.print(maopao[i]+" ");
}
}
}