Class ShakerSort

examples/sort.cpp:90–130

};

class ShakerSort : public CppBenchmark::Benchmark, public SortFixture
{
public:
    using Benchmark::Benchmark;

protected:
    void Run(CppBenchmark::Context& context) override
    {
        // Generate items to sort
        std::generate(items.begin(), items.end(), rand);

        // Start values of left and right bound
        size_t left = 1;
        size_t right = items.size();

        // While left and right bound not met...
        while (left < right)
        {
            // Bubble down minimal item to the left bound
            for (size_t i = right; i > left; --i)
            {
                if (items[i - 1] < items[i - 1 - 1])
                    std::swap(items[i - 1], items[i - 1 - 1]);
            }

            // Increment left bound
            ++left;

            // Bubble up maximal item to the right bound
            for (size_t i = left; i < right; ++i)
            {
                if (items[i + 1 - 1] < items[i - 1])
                    std::swap(items[i + 1 - 1], items[i - 1]);
            }

            // Decrement right bound
            --right;
        }
        context.metrics().AddItems(items.size());
    }
};

class GnomeSort : public CppBenchmark::Benchmark, public SortFixture
{