Class BubbleSort

examples/sort.cpp:61–88

};

class BubbleSort : 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);

        // Iterate through all items to get the current bound
        for (size_t i = 0; i < items.size(); ++i)
        {
            // Calculate the current bound
            size_t bound = items.size() - i;

            // Starting from the current items and for all next items before the bound...
            for (size_t j = 1; j < bound; ++j)
            {
                // Swap items to bubble up minimal one to the end
                if (items[j] < items[j - 1])
                    std::swap(items[j], items[j - 1]);
            }
        }
        context.metrics().AddItems(items.size());
    }
};

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