Function recursion_cost

less_slow.cpp:922–933

template <typename sorter_type_, std::size_t length_> //
static void recursion_cost(bm::State &state) {
    using element_t = typename sorter_type_::element_t;
    sorter_type_ sorter;
    aligned_array<element_t> array(length_);
    for (auto _ : state) {
        for (std::size_t i = 0; i != length_; ++i) array[i] = length_ - i;
        sorter(array.begin(), 0, static_cast<std::ptrdiff_t>(length_ - 1));
    }

    if (!std::is_sorted(array.begin(), array.end())) state.SkipWithError("Array is not sorted!");
    state.SetComplexityN(length_);
}

using recursive_sort_i32s = quick_sort_recurse<std::int32_t>;
using iterative_sort_i32s = quick_sort_iterate<std::int32_t>;