[Haskell-cafe] Shootout favoring imperative code

[Sebastian Sylvan]

On 1/4/06, Brent Fulgham <bfulg at pacbell.net> wrote:
> --- Sebastian Sylvan <sebastian.sylvan at gmail.com>
> wrote:
> > My point here was that even though you _can_
> > generate this data in Haskell, there's no point in
> requiring
> > (because the order doesn't matter for the benchmark
> itself).
>
> We do need to agree on which 30 permutations should be
> used
> in the validation of the benchmark (just to make sure
> that
> the algorithms are producing correct output).

Wouldn't the "maximum number of flips" output be enough for validation?


/S

--
Sebastian Sylvan
+46(0)736-818655
UIN: 44640862