The sort function implements a stable sorting algorithm. It is
a special case of sortBy, which allows the programmer to supply
their own comparison function.
Elements are arranged from lowest to highest, keeping duplicates in
the order they appeared in the input.
sort sorts the specified Seq by the
natural ordering of its elements. The sort is stable. If stability is
not required, unstableSort can be slightly faster.
The sort function implements a stable sorting algorithm. It is
a special case of sortBy, which allows the programmer to supply
their own comparison function.
Elements are arranged from lowest to highest, keeping duplicates in
the order they appeared in the input.
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.
The sort function implements a stable sorting algorithm. It is
a special case of sortBy, which allows the programmer to supply
their own comparison function.
sort sorts the specified NESeq by the
natural ordering of its elements. The sort is stable. If stability is
not required, unstableSort can be slightly faster.