[Haskell-cafe] Suspected stupid Haskell Question

manu emmanuel.delaborde at citycampus.com
Wed Oct 17 08:53:46 EDT 2007


 > 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
  


More information about the Haskell-Cafe mailing list