On 7/19/07, Sebastian Sylvan <sebastian.sylvan@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 :-)