Re: [Haskell-cafe] List concat

G'day all. Quoting Andrew Coppin :

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