**Packages**- is:exact

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 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]

A right-biased version of ordNub.
Example:

>>> ordNub [1,2,1] :: [Int] [1,2]

>>> ordNubRight [1,2,1] :: [Int] [2,1]

cycle ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity on
infinite lists.

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.

A total variant of tail.