Function sort_small

src/fl/stl/algorithm.h:612–617

// Use `fl::sort` (quicksort) when the container is unbounded or large.
template <typename Iterator, typename Compare>
void sort_small(Iterator first, Iterator last, Compare comp) FL_NOEXCEPT {
    if (first == last || first + 1 == last) {
        return;  // Already sorted or empty
    }
    detail::insertion_sort(first, last, comp);
}

template <typename Iterator>
void sort_small(Iterator first, Iterator last) FL_NOEXCEPT {