Class InsertSort

examples/sort.cpp:176–200

};

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

        // Sort items
        for (size_t i = 1; i < items.size(); ++i)
        {
            // Take the next item
            for (size_t j = i + 1; j > 1; --j)
            {
                // Check the current item with the previous one
                if (items[j - 1] < items[j - 1 - 1])
                    std::swap(items[j - 1], items[j - 1 - 1]);
            }
        }
        context.metrics().AddItems(items.size());
    }
};

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