//快速排序法
    private void quickSort(int left ,int right){
        if (right>left) {
            Object ol = elementAt(right);//拿到该索引对应的值
            int i = left -1;
            int j = right;
            while (true) {
                while (compare.lessThan(elementAt(++i), ol)); //回调 判断条件
                while(j>0){
                    if (compare.lessThanOrEqual(elementAt(--j), ol))
                        break;
                }
                    if (i>=j){
                        break;
                    }
                    swap(i,j);    //把对应的下标交换
            }
                    swap(i,right);
                    quickSort(left, i-1);//递归
                    [color=#FF0000]quickSort(i+1, right);//什么时候调用？[/color]
                    
                
        }
        
    }