Hoogle Search
Within LTS Haskell 9.5 (ghc8.0.2)

base Data.List 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 :: Ord a => NonEmpty a > NonEmpty a
base Data.List.NonEmpty Sort a stream.

base GHC.OldList 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 :: ByteString > ByteString
bytestring Data.ByteString O(n) Sort a ByteString efficiently, using counting sort.
sort :: ByteString > ByteString
bytestring Data.ByteString.Char8 O(n) Sort a ByteString efficiently, using counting sort.
sort :: Ord a => Seq a > Seq a
containers Data.Sequence O(n log n). sort sorts the specified Seq by the natural ordering of its elements. The sort is stable. If stability is not required, unstableSort can be considerably faster, and in particular uses less memory.
sort :: Ord b => (a > b) > [a] > [a]
utilityht Data.List.Key No documentation available.
sort :: (IsSequence seq, Ord (Element seq)) => seq > seq
monotraversable Data.Sequences Sort a ordered sequence.
> sort [4,3,1,2] [1,2,3,4]

vectoralgorithms Data.Vector.Algorithms.AmericanFlag 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.
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e > m ()
vectoralgorithms Data.Vector.Algorithms.Heap Sorts an entire array using the default ordering.
Page 1 of many  Next