快速排序 java版本

public class QuickSortMethod {

	public static void main(String[] args) {
		int[] a = {4,1,3,2,16,9,10,14,8,7};
		QuickSort(a,0,a.length-1);
		for(int i:a){
			System.out.print(i+" ");
		}
		

	}

	public static int p(int[] a,int l,int r){
		int k = a[l];
		while(l < r){
			if(l<r && a[r] >= k) --r;
			a[l] = a[r];
			if(l<r && a[l] <= k) ++l;
			a[r] = a[l];
		}
		a[l] = k;
		return l;
	}
	
	public static void QuickSort(int[] a,int l ,int r){
		int i;
		if(l<r){
			i = p(a,l,r);
			QuickSort(a, l, i-1);
			QuickSort(a, i+1, r);
		}