package lee;
public class MaoPao {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int score[] = {69, 62, 75, 85, 81, 99, 91, 100};
for(int i=0;i<score.length-1;i++){
for(int j=0;j<score.length-i-1;j++){
int temp=0;
if(score[j]>score[j+1]){
temp=score[j];
score[j]=score[j+1];
score[j+1]=temp;
}
}
}
System.out.println("冒泡排序的算法:");
for(int a=0;a<score.length-1;a++){
System.out.print(score[a]+",");
}
System.out.println();
}
}
java冒泡算法
最新推荐文章于 2024-03-06 16:12:48 发布