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

        if (low < i - 2)
            splitPivotLastTest(low, i - 2);
        if (i < high)
            splitPivotLastTest(i, high);
    }