On 24/05/11 22:41, Johannes Waldmann wrote: > Then tell me, why does calculating the length of a (Haskell) > list has O(n) complexity. Infiniticity aside, tail would become O(n) if you store a length with each cons cell. -- Tony Morris http://tmorris.net/