On 08/10/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
large -> large depends on large input like above but roughly same otherwise small -> large roughly same
Actually, it's an important point that laziness is generally preferable in these cases as well, since the large result might never be completely demanded, so if the function is lazy, then it will waste no time computing things that are never needed. I might also like to point out that by "small" and "large", we're actually referring to the number of ways in which components of the datastructure can be computed separately, which tends to correspond nicely to how one usually pictures small and large pieces of data. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe