冒泡法排序
冒泡排序法进行降序排序
public class XExercise01 {
public static void main(String[] args) {
//声明部分
int t;
int[] arr = {71,54,29,31,78,2,77,82};
System.out.println("原始数组:");
for (int x : arr) {
System.out.print(x + "\t");
}
System.out.println();
//处理部分
for (int i = 0; i < arr.length - 1 ; i++){
for (int j = 0; j < arr.length - 1 - i;j++) {
//arr[j]与arr[j+1]比较
if (arr[j] < arr[j + 1]) {
t = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = t;
}
}
}
System.out.println("降序排列:");
for (int x : arr) {
System.out.print(x + "\t");
}
System.out.println();
}
}
结果显示: