add `reverseSort` to Data.List
It seems reasonable to have a "fused" reverse sort function in base.
reverseSort function to Data.List to provide an easily discoverable way to doing a descending sort of a list.
reverseSort :: Ord a => [a] -> [a]
From my testing it seems that
reverse . sort is actually fast(est) (at least for -O1), though it doesn't stabilize the sort order.