Re: [Haskell-cafe] Suspected stupid Haskell Question
17 Oct
2007
17 Oct
'07
8:53 a.m.
The problem there is that nub is O(n^2).
Is there a place where one can look up the complexity of Standard Libraries functions ? E.D
6592
Age (days ago)
6592
Last active (days ago)
1 comments
2 participants
participants (2)
-
manu -
Yitzchak Gale