Re:Efficient Amortised and Real-Time Queues in Haskell
by jkarni on Saturday January 16, 2016 @05:45AM
(#10914962)
If you're talking about the discussion of head and snoc at the beginning of the article, laziness just moved the costs around - head becomes O(n) (from O(1)), but snoc becomes O(1) (from O(n)), because you only pay for the snoc costs when inspecting the queue with 'head'.
[ Parent
| on HN ]
There are no comments on this comment yet.