A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
Fastest of Fastest Algorithm to calculate 10000 primes in python ?is it
anonymous
 5 years ago
Fastest of Fastest Algorithm to calculate 10000 primes in python ?is it

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0import 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[noofprime1] print st print et print (etst)/60

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i get this time when checked without writing to list prime 104729 st:1298174950.11 et:1298174952.94 0.0471333344777
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.