@。啊哈算法-java-新手入门-快速排序

package 第一章;

import java.util.Scanner;

public class 快速排序 {
	public static void main(String[] args) {
		Scanner inScanner = new Scanner(System.in);
		int n = inScanner.nextInt()+1;
		int[] a = new int[n];
		for (int i = 1; i < a.length; i++) {
			a[i] = inScanner.nextInt();
		}
		quickSort(1,n-1,a);
		
		for (int i = 1; i < a.length; i++) {
			System.out.print(a[i]+" ");
		}
		
	}

	private static void quickSort(int left, int right, int[] a) {
		if (right<left) {
			return;
		}
		
		int i = left;
		int j = right;
		int temp = a[left];//这是基数
		int t = 0;
		while (i!=j) {
			while (i<j&&a[j]>=temp) {
				j--;
			}
			while (i<j&&a[i]<=temp) {
				i++;
			}
			
			if (i<j) {
				t = a[i];
				a[i] = a[j];
				a[j] = t;
			}
		}
		
		//归位
		a[left] = a[i];
		a[i] = temp;
		
		quickSort(left, i-1,a);
		quickSort(i+1, right, a);
		return;
		
	}
}