Java蓝桥杯--基础练习 （1）数列排序

题目：

解决方案：

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        long F[] = new long[n + 3];
        for (int i = 0; i <= n-1; i++) {
            F[i] = read.nextInt();
        }
        for (int i = 0; i < n-1; i++) {
            for(int j=i+1;j<n;j++){
                if (F[i] > F[j]) {
                long m = F[i];F[i] = F[j];F[j] = m;
            } 
            }
        }
        for (int i = 0; i <= n-1; i++) {
           System.out.print(F[i]);
            System.out.print(" ");
        }
    }
}