raw_loop_merge_sort.cpp

template<typename ForwardIterator>
void stable_sort_forward(ForwardIterator first, ForwardIterator last)
{
    using Range = std::pair<ForwardIterator, ForwardIterator>;
    using Counter = binary_counter<merger<ForwardIterator>, Range>;

    Counter c { merger<ForwardIterator>{}, { last, last } };
    for (; first != last; ++first) {
        c.add(std::make_pair(first, std::next(first)));
    }
    auto result = c.reduce();
}