蓝桥杯 数组排序

import java.util.Scanner;

public class Main {  
    
    public static void main(String[] args) {  
        Scanner sc = new Scanner(System.in);  
        int n = sc.nextInt();  
        int[] a = new int[n];  
        for(int i=0; i<n; i++){   
            a[i] = sc.nextInt();  
            for(int j=i;j>0; j--){  
                if(a[j] < a[j-1]){  
                    int temp = a[j-1];  
                    a[j-1] = a[j];  
                    a[j] = temp;  
                }else{  
                    break;  
                }  
            }  
        }  
        for(int i=0; i<n; i++){  
            System.out.print(a[i]+" ");  
        }  
    }  
}