[Haskell-cafe] Producing MinimumValue

[Hugh Perkins]

On 7/19/07, Sebastian Sylvan <sebastian.sylvan at gmail.com> 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 :-)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20070719/2f0d1196/attachment.htm