Someone

    private int partition(int array[], int left, int right)    {    	int pivot = (array[left]+array[right/2]+array[right])/3;        int limit = left;        for (int i = left+1; i <= right; i++) {            if (array[i] < pivot) {                limit++;                swap(array, limit, i);            }        }        swap(array, left, limit);        return limit;    }