[Haskell-cafe] Prime finding

[Melissa O'Neill]

*sigh* don't click send at 2:30am...

I wrote:
> The algorithm named "Naive" in my table is called SimplePrimes in  
> the zip file, and the example named "sieve" in my table is called  
> "NaivePrimes" in the zip file.

The algorithm named "Naive" in my table is called SimplePrimes in the  
zip file, and the example named "sieve" in my table is called  
"NaiveSieve" in the zip file.

    Melissa.