出差回来--快速排序

public class QuickSort {

    /**
     * @param args
     */
    public static void main(String[] args) {
        QuickSort sort = new QuickSort();
        int[] nums = {2,3,3,3,1,2,2,2};
        sort.quickSort(nums, 0, nums.length - 1);
        for(int num: nums)
            System.out.print(num+" ");
    }
    public void quickSort(int[] nums, int left, int right)
    {
        if(left < right)
        {
            int index = partition(nums, left, right);
            quickSort(nums, left, index - 1);
            quickSort(nums, index + 1, right);
        }
    }
    public int partition(int[] nums, int left, int right)
    {
        int key = nums[left];
        int low = left; 
        int high = right;
        while(low < high)
        {
            while(low < high && nums[high] >= key) high--;
            nums[low] = nums[high];
            while(low < high && nums[low] < key ) low++;
            nums[high] = nums[low];
        }
        nums[low] = key;
        return low;
        
    }

}