Method MergeSortInternal

examples/sort.cpp:277–305

private:
    static void MergeSortInternal(int* dst, int* src, size_t index, size_t size, size_t chunk)
    {
        size_t index1 = 0;
        size_t index2 = 0;

        while ((index1 < chunk) || (index2 < chunk))
        {
            // Check bounds of left chunk
            if ((index + index1 >= size))
                index1 = chunk;
            // Check bounds of right chunk
            if (index + chunk + index2 >= size)
                index2 = chunk;

            // Check if we use right or left chunk for merge
            if ((index2 < chunk) && ((index1 == chunk) || (src[chunk + index2] < src[index1])))
            {
                // Use right chunk
                *dst++ = src[chunk + index2];
                ++index2;
            }
            else if (index1 < chunk)
            {
                // Use left chunk
                *dst++ = src[index1];
                ++index1;
            }
        }
    }
};

class QuickSort : public CppBenchmark::Benchmark, public SortFixture