public class PaiXu { public static void main(String[] args) { int[] a = {34,1,24,6,78}; System.out.println(Arrays.toString(MaoPao(a))); } public static int[] MaoPao(int[] array){ //临时变量 int temp = 0; //外层循环,判断要循环的次数 for (int i = 0; i < array.length-1 ; i++) { //通过flasg标记,减少没有意义的比较 boolean flag = false; //内层循环,判断两个数,如果第一个数比第二个数大,交换位置 for (int j = 0; j <array.length-1-i; j++) { if (array[j+1]>array[j]){ temp = array[j+1]; array[j+1] = array[j]; array[j] = temp; flag = true; } } if (flag == false){ break; } } return array; } }