itertools::insertion_sort

#include <itertools.hpp>

Synopsis

1. template<typename BidirIt, typename Compare = std::less<>

   std::size_t insertion_sort (BidirIt first, BidirIt last, Compare comp = {})
2. template<typename Range, typename Compare = std::less<>

   std::size_t insertion_sort (Range && rng, Compare comp = {})

Documentation

Template parameters

• BidirIt Bidirectional iterator type.

• Compare Comparison function type.

• Range Bidirectional range type.

Parameters

• first Bidirectional iterator to the first element of the range.

• last Bidirectional iterator to the element after the last of the range.

• comp Comparison function callable with two dereferenced iterators.

• rng A bidirectional range to sort.

Returns

Number of swaps necessary to sort the range.