冒泡排序

Posted 2020-08-21 binbgo

public static void main(String[] args) {
        int[] score =new int[] { 88, 35, 75, 87, 20, 90, 2, 756 };
        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] > score[j + 1]) { // 把小的值交换到后面
                    int temp = score[j];
                    score[j] = score[j + 1];
                    score[j + 1] = temp;
                }
            }
            
        }
        System.out.print("最终排序结果：");
        for (int a = 0; a < score.length; a++) {
            System.out.print(score[a] + "\t");
        }
    }

}