快速排序

public class QS {


    public  int getMiddle(Integer[] list, int low, int high) {  
        int tmp = list[low];    //数组的第一个作为中轴 
        while (low < high) {  //tmp是基准数
            while (low < high && list[high] > tmp) {  //j向左移 找到小于tmp的数停下
                high--;  
            }  
            list[low] = list[high];   //比中轴小的记录移到低端 
            while (low < high && list[low] < tmp) {  //i向右移 找到大于tmp的数停下
                low++;  
            }  
            list[high] = list[low];   //比中轴大的记录移到高端 
        }  
        list[low] = tmp;              //中轴记录到尾 
        return low;                   //返回中轴的位置 
    }  

    public  void _quickSort(Integer[] list, int low, int high) {  
        if (low < high) {  
            int middle = getMiddle(list, low, high);  //将list数组进行一分为二 
            _quickSort(list, low, middle - 1);        //对低字表进行递归排序 
            _quickSort(list, middle + 1, high);       //对高字表进行递归排序 
        }  
    }

    public void quick(Integer[] str) {  
        if (str.length > 0) {    //查看数组是否为空 
            _quickSort(str, 0, str.length - 1);  
        }  
    }

}

public class test {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        // TODO Auto-generated method stub 
        Integer[] list={34,3,53,2,23,7,14,10,5,8,12,46,49,55};  
        for(int i=0;i<list.length;i++){  
            System.out.print(list[i]+" ");  
        }
        System.out.println(); 
        QS qs=new QS();  
        qs.quick(list);  
        for(int i=0;i<list.length;i++){  
            System.out.print(list[i]+" ");  
        }  
        System.out.println(); 
    }
}