//冒泡排序法(大在前 小在后)
import java.util.Scanner;
public class BubbleSort{
public static void main(String[] args){
//冒泡排序法(大在前 小在后)
Scanner sc = new Scanner(System.in);
System.out.println("请输入要排序的数量");
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("请依次输入要排序的数字");
for(int i = 0;i < n;i++){
arr[i] = sc.nextInt();
}
System.out.println("输入的数字是:");
for(int i = 0;i < n;i++){
System.out.print(arr[i] + " ");
}
for(int i = 0;i < n - 1;i++){
for(int j = 0;j < n - i - 1;j++){
int temp = 0;
if(arr[j] <= arr[j + 1]){
temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
}
System.out.println("排序后的数字顺序如下");
for(int i = 0;i < n;i++){
System.out.print(arr[i] + " ");
}
}
}