quickSort

package POJ;

public class Main {

    /**
     * 
     * QuickSort
     * 
     */
    public static void main(String[] args) {
        Main so = new Main();
        int[] list = { 6, 4, 2, 3, 1, 5, 10, 4, 9, 8, 11, 7 };    
        int[] result=so.quickSort(list, 0, 11);
        for(int i:result)
            System.out.println(i);
    }    
    public int[] quickSort(int[] list,int left,int right){
        int index=partition(list,left,right);
        if(left<index-1){
            quickSort(list, left, index-1);
        }
        if(index<right){
            quickSort(list, index, right);
        }
        return list;
    }
    private int partition(int[] list, int left, int right) {
        // TODO Auto-generated method stub
        int pivot=list[(left+right)/2];
        while(left<=right){
            while(list[left]<pivot)
                left++;
            while(list[right]>pivot)
                right--;
            if(left<=right){
                swap(list,left,right);
                left++;
                right--;
            }
        }
        return left;
    }
    private void swap(int[] list, int left, int right) {
        // TODO Auto-generated method stub
        int temp=list[left];
        list[left]=list[right];
        list[right]=temp;
    }
}