Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 25 Online
OpenStudy (anonymous):

Fastest of Fastest Algorithm to calculate 10000 primes in python ?is it

OpenStudy (anonymous):

import time from math import sqrt st=time.time() mdu=0 check =3 noofprime=2 primeLs=[2,3] prime=True while noofprime!=10000: check=check+2 if check%3==0:check=check+2 sqrcheck=int (sqrt(check))+1 for div in range (3,sqrcheck): prime=True mdu=check%div if mdu==0 : prime=False break if prime==True: noofprime= noofprime+1 primeLs=primeLs+[check] et=time.time() print primeLs[noofprime-1] print st print et print (et-st)/60

OpenStudy (anonymous):

i get this time when checked without writing to list prime 104729 st:1298174950.11 et:1298174952.94 0.0471333344777

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!