quicksort_impl()

template<typename Iterator, typename Compare>

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

Definition at line 416 of file algorithm.h.

                                                                              {
    if (last - first <= 16) {  // Use insertion sort for small arrays
        insertion_sort(first, last, comp);
        return;
    }
    
    Iterator pivot = partition(first, last, comp);
    quicksort_impl(first, pivot, comp);
    quicksort_impl(pivot + 1, last, comp);
}

References fl::FL_NO_EXCEPT, insertion_sort(), partition(), and quicksort_impl().

Referenced by quicksort_impl(), and fl::adl_barrier::sort().

Here is the call graph for this function:

Here is the caller graph for this function: