The same heap sort as quick_sort (unstable, O(n log n)); the name is kept so that code written for either works.
quick_sort_iter :: (array: $T/Xar, f: (T.Element_Type, T.Element_Type) -> $R)All three public names are this one heap sort.
Parameters
- array: $T/Xar
- f: (T.Element_Type, T.Element_Type) -> $R