:: Ord a => [a] -> [a] package:list-t
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]
returns the elements of xs
reverse order. xs
must be finite.
ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity on
Return all the elements of a list except the last one.
The list must be non-empty.
Extract the elements after the head of a list, which
must be non-empty.