sort -base -containers -package

sort :: ByteString -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8
O(n) Sort a ByteString efficiently, using counting sort.
heapsort :: Ord a => [a] -> [a]
fgl Data.Graph.Inductive.Internal.Heap
topsort :: Graph gr => gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
topsort' :: Graph gr => gr a b -> [a]
fgl Data.Graph.Inductive.Query.DFS