public static void splitPivotLast(int low, int high) {
        int i = low;
        for (int j = low; j < high; j++) {
            countLast++;
            if (result[j] < result[high]) {
                exchange(j, i);
                i++;
            }
        }
        exchange(high, i);

        if (low < i - 1)
            splitPivotLast(low, i - 1);
        if (i + 1 < high)
            splitPivotLast(i + 1, high);
    }