宝藏排序2（数据范围）

题目


快速排序

import java.util.Scanner;

//快速排序
public class Main {
	public static void quick_sort(int[] q,int l,int r) {
		if(l>=r)	return ;
		int i = l-1;
		int j = r+1;
		int x = q[(l+r)/2];
		while(i<j) {
			do	i++; while(q[i]<x);
			do	j--; while(q[j]>x);
			if(i<j) {
				int t = q[i];
				q[i] = q[j];
				q[j] = t;
			}
		}
		quick_sort(q, l, j);
		quick_sort(q, j+1, r);
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.nextLine();
		int[] q = new int[n];
		for(int i=0;i<n;i++) {
			q[i] = sc.nextInt();
		}
		quick_sort(q,0,n-1);
		for(int i=0;i<n;i++) {
			System.out.print(q[i]+" ");
		}
		sc.close();
	}
}

Arrays的sort方法

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.nextLine();
		int[] q = new int[n];
		for(int i=0;i<n;i++) {
			q[i] = sc.nextInt();
		}
      	Arrays.sort(q);
	  	for(int i=0;i<n;i++) {
			System.out.print(q[i]+" ");
		}
		sc.close();
	}
}