12 May
2008
12 May
'08
2:36 p.m.
G'day all. Quoting Andrew Coppin <andrewcoppin@btinternet.com>:
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