tetl-docs/merge__sort_8hpp_source.html

// SPDX-License-Identifier: BSL-1.0


#ifndef TETL_ALGORITHM_MERGE_SORT_HPP

#define TETL_ALGORITHM_MERGE_SORT_HPP


#include <etl/_algorithm/inplace_merge.hpp>

#include <etl/_functional/less.hpp>


namespace etl {


template <typename BidirIt, typename Compare>


constexpr auto merge_sort(BidirIt first, BidirIt last, Compare comp) -> void

{

    if (last - first > 1) {

        BidirIt mid = first + (last - first) / 2;

        etl::merge_sort(first, mid, comp);

        etl::merge_sort(mid, last, comp);

        etl::inplace_merge(first, mid, last, comp);

    }

}


template <typename BidirIt>


constexpr auto merge_sort(BidirIt first, BidirIt last) -> void

{

    etl::merge_sort(first, last, etl::less());

}


} // namespace etl


#endif // TETL_ALGORITHM_MERGE_SORT_HPP

etl::merge_sort
constexpr auto merge_sort(BidirIt first, BidirIt last, Compare comp) -> void
Sorts the elements in the range [first, last) in non-descending order.
Definition merge_sort.hpp:18

etl::inplace_merge
constexpr auto inplace_merge(BidirIt begin, BidirIt mid, BidirIt end, Compare comp) -> void
Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first,...
Definition inplace_merge.hpp:25

inplace_merge.hpp

less.hpp

etl
Definition adjacent_find.hpp:8

etl::less
Function object for performing comparisons. Unless specialised, invokes operator< on type T....
Definition less.hpp:14