G'day all. Quoting Andrew Coppin <[EMAIL PROTECTED]>:
The function (++) :: [x] -> [x] -> [x] has O(n) complexity.
That's not entirely true. When you call (++), it does O(1) work. If you evaluate k cons cells. it takes O(min(k,n)) work. Cheers, Andrew Bromage _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
