heap_sort()

template<typename Iterator, typename Compare>

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

Definition at line 398 of file algorithm.h.

                                                                         {
    heapify(first, last, comp);
    
    Iterator end = last - 1;
    while (end > first) {
        swap(*end, *first);
        sift_down(first, first, end - 1, comp);
        --end;
    }
}

References fl::end(), fl::FL_NO_EXCEPT, heapify(), sift_down(), and fl::swap().

Here is the call graph for this function: