JAVA-最简单的快速排序

public class jj {
	
	
	public static void main(String[] args) {
		int []a={1,3,43,5,33,53,3,7,-9,23,90};
		int low=0;
		int high=a.length-1;
		quicksort(a,low,high);
		for(int x=0;x<=high;x++)
		System.out.print(a[x]+",");
		
		
		
	}
	public static void quicksort(int a[],int low,int high)
	{
		int l=low;
		int r=high;
		int temp=a[l];
		if(l<r)
		{
		while(l<r)
		{
			while(l<r&&a[r]>temp)
				r--;
			if(l<r)
				a[l]=a[r];
			while(l<r&&a[l]<=temp)
				l++;
			if(l<r)
				a[r]=a[l];
		}
		a[l]=temp;
		quicksort(a,low,l-1);
		quicksort(a,l+1,high);
		
		}	
		
	}
	
}