public static void splitQuick(int low, int high) {

        int i = low, j = high;
        int pivot = result[i + (j - i) / 2];
        do {
            while (result[i] < pivot) i++;
            while (result[j] > pivot) j--;


            if (i <= j) {
                exchange(i, j);
                i++;
                j--;
            }

        } while (i <= j);
        if (low < j)
            splitQuick(low, j);
        if (i < high)
            splitQuick(i, high);
    }