蓝桥杯-基础练习 数列排序

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	
	public static void main(String[] args) {
		int n = sc.nextInt();//一个整数n
		int nArr[] = new int[n];//存储n个整数的数组
		for (int i = 0; i < nArr.length; i++) {
			nArr[i] = sc.nextInt();
		}
		
		Arrays.sort(nArr);//排序
		
		//打印
		for (int i = 0; i < nArr.length; i++) {
			System.out.print(nArr[i]+ " ");
		}
	}
}

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	
	public static void main(String[] args) {
		int n = sc.nextInt();//一个整数n
		int nArr[] = new int[n];//存储n个整数的数组
		for (int i = 0; i < nArr.length; i++) {
			nArr[i] = sc.nextInt();
		}
		
		nArr = insertionSoft(nArr);//排序
		
		for (int i = 0; i < nArr.length; i++) {
			System.out.print(nArr[i]+ " ");
		}
		
	}
	
	//插入排序
	static public int[] insertionSoft(int[] A){
		for (int j = 1; j < A.length; j++) {
			int key = A[j];
			int i = j - 1;
			
			while ((i>=0) && (A[i] > key)) {
				A[ i + 1 ] = A[i];
				i = i - 1;
			}
			A[i + 1] = key;
		}
		return A;
	}
	
}