mergesort_impl()

template<typename Iterator, typename Compare>

void fl::detail::mergesort_impl	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 534 of file algorithm.h.

                                                                              {
    auto size = last - first;
    if (size <= 16) {  // Use insertion sort for small arrays (it's stable)
        insertion_sort(first, last, comp);
        return;
    }
    
    Iterator middle = first + size / 2;
    mergesort_impl(first, middle, comp);
    mergesort_impl(middle, last, comp);
    merge_inplace(first, middle, last, comp);
}

References fl::FL_NO_EXCEPT, insertion_sort(), merge_inplace(), and mergesort_impl().

Referenced by mergesort_impl(), and fl::stable_sort().

Here is the call graph for this function:

Here is the caller graph for this function: