[数据结构][Sort]Quick Sort

public class Solution 
{
    public int getMiddle(int[] data, int left, int right)
    {
        int middle = data[left];
        
        while(left < right)
        {
            while((left < right) && (middle <= data[right]))
            {
                right --;
            }
            data[left] = data[right];
            
            while((left < right) && (middle >= data[left]))
            {
                left ++;
            }
            data[right] = data[left];
        }
        
        data[left] = middle;
        
        return left;
    }
    
    public void quickSort(int[] data, int left, int right)
    {    
        if(left < right)
        {
            int middle = getMiddle(data, left, right);
            
            quickSort(data, left, middle - 1);
            
            quickSort(data, middle + 1, right);
        }
    }
    
    public void adapter(int[] data)
    {
        quickSort(data, 0, data.length - 1);
    }
    
}