Tree sort in Haskell


module TreeSort where
import Data.Set (toList, fromList)

treeSort :: Ord a => [a] -> [a]
treeSort = toList . fromList

>>3
Tree sort is good when the data is coming from a streaming source, like a file. You just add each item into the set until done, and it's already sorted (at least in tree form.)