一个快排

import java.util.Arrays;
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();
		}
		
		sortArray(a, 0, n-1);
		for(int i = 0 ; i < n ; i++ ){
			System.out.print(a[i]+" ");
		}
		
	}
	public static void sortArray(int a[],int left,int right){
		if(left >= right) //经常把出口给忘记了。该打！
			return;
		int i = left;
		int j = right;
		int key = a[left];
		
		while(i < j){
			while(i < j && a[j] >= key )
				j--;
			a[i] = a[j];
			while(i <j && a[i] <= key)
				i++;
			a[j] = a[i];
			
		}
		a[i] = key;
		sortArray(a, left, i-1);
		sortArray(a, i+1, right);
		
	}
	
}