Java 快速排序 quicksort

package algorithm;

public class QuickSort {
	
	public static void main(String[] args) {
		int[] a = {3,2,5,1,9,7,6};
		quickSort(a,0,6);
		for(int i=0;i<a.length;i++)
			System.out.print(" "+a[i]);
	}
	
	public static void quickSort(int[] a,int left,int right){
		if(left<right){
			int pivot = partition(a,left,right);
			quickSort(a, left, pivot-1);
			quickSort(a, pivot+1, right);
		}
	}

	private static int partition(int[] a, int left, int right) {
		int pivot = a[left];
		while(left<right){
			while(left<right&&pivot<=a[right]) --right;
			a[left]=a[right];
			while(left<right&&pivot>=a[left])  ++left;
			a[right]=a[left];
 		}
		a[left]=pivot;
		return left;
	}
}