sort -package:data-ordlist package:linear-base

sort :: Ord a => [a] -> [a]
linear-base Data.List.Linear
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]
sortOn :: Ord b => (a -> b) -> [a] -> [a]
linear-base Data.List.Linear
Sort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy (comparing f), but has the performance advantage of only evaluating f once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input. 
>>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]