冒泡排序

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