package com.zhidi.test;
public class Paixu1 {
public static void main(String[] args) {
// 冒泡排序(降序)
int[] arr = {51,29,34,46,22,24,52,68,89,93};
System.out.print("排序前:");
for (int i : arr) {
System.out.print(i+" ");
}
System.out.println();
System.out.println("-----------------------------");
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-i-1 ; j++) {
if(arr[j] < arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.print("排序后:");
//遍历数组
for (int i : arr) {
System.out.print(i+" ");
}
}
}