That helps a lot. It was stupid of me to not compare the output from
the two functions.
The second for loop is actually skiiping over some of the values and
hence it takes longer to run when the "plst" is generated.
On Wed, Jun 24, 2009 at 8:16 AM, Luke
Paireepinart wrote:
> Yash wrote:
>>
>> Hel
Yash wrote:
Hello,
I am a newbie to python. I am trying to practice writing a code in
python and am trying to write a function to generate prime numbers
using sieve of Eratosthenes. (code follows at the end of mail)
The way it is coded, if I change the for loop over "j" from
for j in range( (2*i
