1 package com.ibeifeng.paixu;
 2 //冒泡排序算法
 3 public class Demo1 {
 4       public static void main(String[] args){
 5              int score[] = {67, 69, 75, 87, 89, 90, 99, 100};
 6              for (int i = 0; i < score.length -1; i++){    //最多做n-1趟排序
 7                  for(int j = 0 ;j < score.length - i - 1; j++){    //对当前无序区间score[0......length-i-1]进行排序(j的范围很关键，这个范围是在逐步缩小的)
 8                      if(score[j] < score[j + 1]){    //把小的值交换到后面
 9                          int temp = score[j];
10                          score[j] = score[j + 1];
11                          score[j + 1] = temp;
12                      }
13                  }            
14                  System.out.print("第" + (i + 1) + "次排序结果：");
15                  for(int a = 0; a < score.length; a++){
16                      System.out.print(score[a] + "\t");
17                  }
18                  System.out.println("");
19              }
20                  System.out.print("最终排序结果：");
21                  for(int a = 0; a < score.length; a++){
22                      System.out.print(score[a] + "\t");
23             }
24          }
25 }