Function quicksort_impl

src/fl/stl/algorithm.h:411–420

// Quicksort implementation
template <typename Iterator, typename Compare>
void quicksort_impl(Iterator first, Iterator last, Compare comp) FL_NOEXCEPT {
    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);
}

// Rotate elements in range [first, last) so that middle becomes the new first
template <typename Iterator>