sort package:vector-algorithms
Sorts an array using the default ordering. Both Lexicographic and Ord
are necessary because the algorithm falls back to insertion sort for
sufficiently small arrays.
Sorts an entire array using the default ordering.
Sorts an entire array using the default comparison for the type
Sorts an array using the default comparison.
Sorts an array based on the Radix instance.
A fully parameterized version of the sorting algorithm. Again, this
function takes both radix information and a comparison, because the
algorithms falls back to insertion sort for small arrays.
A variant on
sort that returns a vector of unique elements.
A variant on
sortBy which returns a vector of unique elements.
Sorts an entire array using a custom ordering.
Sorts a portion of an array [l,u) using a custom ordering
Given a heap stored in a portion of an array [l,u), sorts the highest
values into [m,u). The elements in [l,m) are not in any particular
order.
A variant on
sort that returns a vector of unique elements.
A variant on
sortBy which returns a vector of unique elements.
Sorts an entire array using a given comparison
Sorts the portion of an array delimited by [l,u)
Sorts the portion of the array delimited by [l,u) under the assumption
that [l,m) is already sorted.
A variant on
sortBy which returns a vector of unique elements.
Sorts an entire array using a custom ordering returning a vector of
the unique elements.
Sorts an array using a custom comparison.
Sorts the elements at the two given indices using the comparison. This
is essentially a compare-and-swap, although the first index is assumed
to be the lower of the two.
Sorts the elements at the positions off and 'off + 1' in the
given array using the comparison.
Sorts the elements at the three given indices. The indices are assumed
to be given from lowest to highest, so if 'l < m < u' then
'sort3ByIndex cmp a m l u' essentially sorts the median of three into
the lowest position in the array.
Sorts the three elements starting at the given offset in the array.
Sorts the elements at the four given indices. Like the 2 and 3 element
versions, this assumes that the indices are given in increasing order,
so it can be used to sort medians into particular positions and so on.
Sorts the four elements beginning at the offset.