A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
Hi all, Im new to programming and just finished assignment 1.1 (which I think is correct). Could someone tell me if there's room for improvement or what could be done better. thanks
heres the code:
http://codepad.org/45TEO6yE
(it only runs the first 20 primes to save time)
anonymous
 4 years ago
Hi all, Im new to programming and just finished assignment 1.1 (which I think is correct). Could someone tell me if there's room for improvement or what could be done better. thanks heres the code: http://codepad.org/45TEO6yE (it only runs the first 20 primes to save time)

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I think it's very nice, but, maybe you could change n%x == 0 to n % x == 0 which improves readability. It's part of the python style guide: http://www.python.org/dev/peps/pep0008/

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0it works great, it will find primes less than 10000. If your search criteria was different or changing you would have to guess what the limit would be in line 2, or know the answer b4 hand. could you rewrite it to find just the 2000th prime? without having to guess how big that number is?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Something like this? http://codepad.org/J67EOiDK

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0you find only prime which is highest in up to 2000 but not 2000th prime

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0@Tomas.A ah, I misread the question.

carlsmith
 4 years ago
Best ResponseYou've already chosen the best response.1I liked this line. for n in range(3, 10000, 2): Using the optional, third arg like that saved you filtering out all the evens afterwards. It was clever to spot that.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0@michalmichalski did you manage to write program like @bwCa said?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0question guys...for this formula, line of for X in range (3,n), i made it: for x in range(3, int(sqrt(n))+1: is this a faster way to run the program

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0My recommendation would be to try and make this program more useful. Try and make it into a function that has input n and output of the nth prime.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0... yep you only really have to check up to the square root  but that's just an optimization

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0@ Tomas, no I didnt write it yet  but I ll give it a try. @ earthbound()  good suggestion with the sqrt, thnks thanks for yr comments!
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.