:: Ord a => [a] -> [a] package:universum

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]
Like nub but runs in O(n * log n) time and requires Ord.
>>> ordNub [3, 3, 3, 2, 2, -1, 1]
[3,2,-1,1]
Like ordNub but also sorts a list.
>>> sortNub [3, 3, 3, 2, 2, -1, 1]
[-1,1,2,3]