[Haskell-cafe] Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

[ajb at spamcop.net]

G'day all.

Quoting Melissa O'Neill <oneill at cs.hmc.edu>:

> Cool, thanks.  When I ran your code trying to find the 10,000th
> prime, I got
>    AtkinSieveTest: Ix{Integer}.index: Index (36213) out of range
> ((0,36212))
> but that went away when I made your array one bigger.

Fixed, thanks.

Cheers,
Andrew Bromage