java-快速排序

public class Test2 {  
  
	
	public static int Partion(int[] arr,int s,int t)
	{
		int i=s,j=t;
		int pre=arr[s];
		while (i<j) {
			while (i<j&&arr[j]>=pre) {
				j--;
			}
			arr[i]=arr[j];
			while (i<j&&arr[i]<=pre) {
				i++;
			}
			arr[j]=arr[i];
		}
		arr[i]=pre;
		return i;
		
	}
	public static void qsort(int[] arr,int s,int t)
	{
		if (s>=t) {
			return;
		}
		int pos=Partion(arr, s, t);//{6,1,3,9,3,6};
		if (pos>s) {
			qsort(arr, s, pos-1);
		}
		if (pos<t) {
			qsort(arr, pos+1, t);
		}
		
	}
    public static void main(String[] args) {
		// TODO Auto-generated method stub  
    	int arr[]={6,1,3,9,3,6};
    	qsort(arr, 0, arr.length-1);
    	for (int i : arr) {
			System.out.print(i+" ");
		}
    }
}