快速排序

package com.learning.algorithm;

public class QuickSort {
    
    public int getMiddle(int[] arrValues, int low, int high){
        int tempValue = arrValues[low];
        while(low<high){
            while(low<high && tempValue<=arrValues[high]){
                high--;
            }
            arrValues[low]=arrValues[high];
            
            while(low<high && tempValue>=arrValues[low]){
                low++;
            }
            arrValues[high]=arrValues[low];
            
            arrValues[low] = tempValue;
            
        }
        return low;
    }
    
    public void quickSort(int[] arrValues, int low, int high){
        if(low<high){
            int middle = getMiddle(arrValues,low,high);
            quickSort(arrValues,low,middle-1);
            quickSort(arrValues,middle+1,high);
        }
        
    }
    
    public void quick(int[] arrValues){
        if(arrValues.length>0){
            quickSort(arrValues,0,arrValues.length-1);
        }
    }

    /**
     * @param args
     */
    public static void main(String[] args) {
        int[] arrValues = {89,39,56,93,2,58,33,43,51,33,67};
        QuickSort qs = new QuickSort();
        qs.quick(arrValues);
        for(int i=0;i<arrValues.length;i++){
            System.out.print(arrValues[i]);
            System.out.print(",");
        }
        

    }

}