sort -package:vector-algorithms

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 [1,6,4,3,2,5]
[1,2,3,4,5,6]

The argument must be finite.

Sort a stream.

O(n) Sort a ByteString efficiently, using counting sort.

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.

>>> sort [1,6,4,3,2,5]
[1,2,3,4,5,6]

Sort a vector.

Sort a ordered sequence.

> sort [4,3,1,2]
[1,2,3,4]

Sort the keys of a Map, forgetting the original ordering

sort (sort x) = sort x

>>> sort (fromList [("B",1),("A",2)])
fromList [("A",2),("B",1)]

Sort the set elements, forgetting their original ordering.

>>> sort (fromList [2, 1]) == fromList [1, 2]
True

Return a list of the sorted elements of the given Shell, keeping duplicates:

>>> sort (select [1,4,2,3,3,7])
[1,2,3,3,4,7]

Sorts the list. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. See also sortBy.

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.

O(n log n). Perform a heap sort

Sort results by this order, [] = no sort. Default = []

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.

sort the elements of a vector into ascending order

A Haskell sorting toolkit A library of general-purpose sorting utilities.

O(n). Sort a list using discrimination.

sort = sortWith id