[Haskell-cafe] Producing MinimumValue

Steve Schafer steve at fenestra.com
Thu Jul 19 15:21:41 EDT 2007

On Thu, 19 Jul 2007 19:26:39 +0100, you wrote:

>Actually, since Haskell is lazy and only the first element is required
>for minimumValue, the above algorithm should be O(n).

You're right (as long as the sort algorithm itself is sufficiently lazy,
of course).

Steve Schafer
Fenestra Technologies Corp.

More information about the Haskell-Cafe mailing list