public class BubbleSort{
public static void main(String[] args){
int score[] = {67, 69, 75, 66, 89, 90, 99, 100};
for (int i = 0; i < score.length -1; i++){ //最多做n-1趟排序
for(int j = 0 ;j < score.length - i - 1; j++){ //对当前无序区间score[0......length-i-1]进行排序(j的范围很关键,这个范围是在逐步缩小的)
if(score[j + 1] < score[j]){ //把小的值交换到后面
int temp = score[j];
score[j] = score[j + 1];
score[j + 1] = temp;
}
}
}
for (int j = 0; j < score.length; j++) {
System.out.print(" " + score[j] + " ");
}
}
} |
|