[Haskell-cafe] Time consumption nub

[Miguel Mitrofanov]

AG> Wondering about time space consuming: 'nub' vs 'map
AG> head.group.sort'

Prelude> :t Data.List.nub
Data.List.nub :: (Eq a) => [a] -> [a]
Prelude> :t Data.List.sort
Data.List.sort :: (Ord a) => [a] -> [a]

nub uses less information than sort, so it MUST be slower.