On 7/19/07, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
Actually, since Haskell is lazy and only the first element is required for minimumValue, the above algorithm should be O(n).
That's pretty cool :-)
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
