Re: ada is getting spanked :(

["Jeffrey R. Carter" <spam.not.jrcarter@acm.not.spam.org>]

Also for nsieve, M is defined to be a multiple of 2, and so we know it 
is not prime. We can omit it from consideration by changing the loop 
condition to

while I < M loop

This is done by the C++ program in 2nd place, for example:

for (size_t i=2; i<m; ++i)
   if (isPrime[i])
     {
       for(size_t k=i*2; k<m; k+=i)
         isPrime[k] = false;
       ++count;
     }

which only looks at 2 .. M - 1.

I don't expect much of an improvement from this, though.

-- 
Jeff Carter
"I'm a kike, a yid, a heebie, a hook nose! I'm Kosher,
Mum! I'm a Red Sea pedestrian, and proud of it!"
Monty Python's Life of Brian
77